Sciweavers

19 search results - page 3 / 4
» Two Step Swarm Intelligence to Solve the Feature Selection P...
Sort
View
CP
2003
Springer
13 years 11 months ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm
ECCV
2002
Springer
14 years 7 months ago
Maximizing Rigidity: Optimal Matching under Scaled-Orthography
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
João Costeira, João Maciel
SARA
2007
Springer
13 years 12 months ago
Boosting MUS Extraction
Abstract. If a CSP instance has no solution, it contains a smaller unsolvable subproblem that makes unsolvable the whole problem. When solving such instance, instead of just return...
Santiago Macho González, Pedro Meseguer
CEC
2009
IEEE
14 years 15 days ago
Examination timetabling using late acceptance hyper-heuristics
— A hyperheuristic is a high level problem solving methodology that performs a search over the space generated by a set of low level heuristics. One of the hyperheuristic framewo...
Ender Özcan, Yuri Bykov, Murat Birben, Edmund...
AAAI
2008
13 years 8 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...