Sciweavers

400 search results - page 25 / 80
» Hard Problem Generation for MKP
Sort
View
ATMOS
2010
136views Optimization» more  ATMOS 2010»
14 years 11 months ago
An Empirical Analysis of Robustness Concepts for Timetabling
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...
Marc Goerigk, Anita Schöbel
108
Voted
CDC
2010
IEEE
119views Control Systems» more  CDC 2010»
14 years 7 months ago
Event-triggered output feedback control of finite horizon discrete-time multi-dimensional linear processes
Event-triggered control systems are systems in which the control signal is recomputed when the plant's output signal leaves a triggering-set. There has been recent interest in...
Lichun Li, Michael Lemmon
AAAI
2012
13 years 3 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
88
Voted
ACL
2006
15 years 2 months ago
Highly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
Daniel Feinstein, Shuly Wintner
ECAI
1994
Springer
15 years 4 months ago
The SAT Phase Transition
We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consi...
Ian P. Gent, Toby Walsh