Sciweavers

443 search results - page 64 / 89
» Analysis of Heuristics for Number Partitioning
Sort
View
AAAI
1990
13 years 9 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
FOGA
2011
12 years 11 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
CAIP
2011
Springer
248views Image Analysis» more  CAIP 2011»
12 years 7 months ago
Statistical Tuning of Adaptive-Weight Depth Map Algorithm
Abstract. In depth map generation, the settings of the algorithm parameters to yield an accurate disparity estimation are usually chosen empirically or based on unplanned experimen...
Alejandro Hoyos, John Congote, Iñigo Barand...
MST
2000
57views more  MST 2000»
13 years 7 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
14 years 8 months ago
SNARE: a link analytic system for graph labeling and risk detection
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
Mary McGlohon, Stephen Bay, Markus G. Anderle, Dav...