7648 search results - page 958 / 1530 » A Data Locality Optimizing Algorithm |
169
click to vote
EVOW
2001
Springer
15 years 11 months ago
2001
Springer
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...
172
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
Subdivision surfaces solve numerous problems related to the geometry of character and animation models. However, unlike on parametrised surfaces there is no natural choice of text...
182
click to vote
IWANN
1997
Springer
15 years 10 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
177
click to vote
CIBCB
2007
IEEE
15 years 10 months ago
2007
IEEE
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
149
Voted
WCNC
2010
IEEE
15 years 10 months ago
2010
IEEE
—The deployment strategy for achieving differentiated coverage and probabilistic connectivity in wireless sensor networks is studied in this paper. A novel solution based on elit...