Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with python
Search options not deleted
user 88283
Python is an interpreted, general-purpose high-level programming language whose design philosophy emphasizes code readability. Use the python tag for all Python related questions. If you believe your question may be even more specific, you can include a version specific tag such as python-3.x.
5
votes
2
answers
2k
views
Finding cells in a 3D grid with free neighbors
I have a program, where the get_free function below has the most major computational cost by far, and I was wondering if there was a faster way to do it. Perhaps an all-numpy solution would be faster. …
- 285
1
vote
Finding cells in a 3D grid with free neighbors
One improvement, with bitwise or:
def get_free2(cell):
"""
Return the indices of a a cell that are 0 and
where all its neighbors are 0 for the same depth
"""
neighs = neighbors2( …
- 285
2
votes
1
answer
94
views
Performance optimization when switching from nested to flat representation (genetic algorithm)
The code below is the core of a Genetic Algorithm (NSGA-II to be precise, without crowding-distance calculation), but I've taken out all the GA-specific parts and made a generic example. I think I've …
- 285
3
votes
0
answers
47
views
Deriving incremental feature representations for bit flips
Given a boolean 3D matrix and a set of actions specifying bit flips at certain positions, a set of resulting matrices can be obtained, one matrix for each action, as if executing each bit flip individ …
- 285