Sciweavers

288 search results - page 32 / 58
» Inclusion Problems for Patterns with a Bounded Number of Var...
Sort
View
SODA
2003
ACM
125views Algorithms» more  SODA 2003»
13 years 9 months ago
Random MAX SAT, random MAX CUT, and their phase transitions
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...
ATAL
2009
Springer
14 years 2 months ago
Evaluating hybrid constraint tightening for scheduling agents
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
James C. Boerkoel Jr., Edmund H. Durfee
TPDS
1998
92views more  TPDS 1998»
13 years 7 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
13 years 11 months ago
Linguistic Rule Extraction by Genetics-Based Machine Learning
This paper shows how linguistic classification knowledge can be extracted from numerical data for pattern classification problems with many continuous attributes by genetic algori...
Hisao Ishibuchi, Tomoharu Nakashima
CVPR
2003
IEEE
14 years 9 months ago
Spacetime Stereo: A Unifying Framework for Depth from Triangulation
Depth from triangulation has traditionally been treated in a number of separate threads in the computer vision literature, with methods like stereo, laser scanning, and coded stru...
James Davis, Ravi Ramamoorthi, Szymon Rusinkiewicz