14548 search results - page 405 / 2910 » The Optimal Path-Matching Problem |
148
click to vote
DOCENG
2006
ACM
16 years 22 days ago
2006
ACM
Automatic table layout is required in web applications. Unfortunately, this is NP-hard for reasonable layout requirements such as minimizing table height for a given width. One ap...
181
click to vote
EUROGP
2005
Springer
16 years 9 days ago
2005
Springer
We describe an approach to understanding evolved programs for a real world object detection problem, that of finding orthodontic landmarks in cranio-facial X-Rays. The approach in...
155
click to vote
GECCO
2004
Springer
16 years 5 days ago
2004
Springer
This paper presents an investigation of genetic programming fitness landscapes. We propose a new indicator of problem hardness for tree-based genetic programming, called negative ...
159
click to vote
ADHOCNOW
2003
Springer
16 years 12 hour ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
147
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...