93 search results - page 9 / 19 » Hybrid symbolic-explicit techniques for the graph coloring p... |
COMPGEOM
2006
ACM
14 years 20 days ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
IANDC
2007
13 years 6 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
JAIR
2010
13 years 5 months ago
2010
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
CVPR
2003
IEEE
14 years 8 months ago
2003
IEEE
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...
CEC
2011
IEEE
12 years 6 months ago
2011
IEEE
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...