Sciweavers

422 search results - page 76 / 85
» Multithreaded SAT Solving
Sort
View
IPPS
2009
IEEE
14 years 4 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
LPNMR
2009
Springer
14 years 4 months ago
A Module-Based Framework for Multi-language Constraint Modeling
We develop a module-based framework for constraint modeling where it is possible to combine different constraint modeling languages and exploit their strengths in a flexible way. ...
Matti Järvisalo, Emilia Oikarinen, Tomi Janhu...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
14 years 4 months ago
Fast Handover Scheme for Real-Time Applications in Mobile WiMAX
—Mobile WiMAX is one of the most promising technologies for broadband wireless communication. The IEEE 802.16e standard for Mobile WiMAX, the enhanced version of the IEEE 802.16 ...
Wenhua Jiao, Pin Jiang, Yuanyuan Ma
ICCV
2007
IEEE
14 years 4 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
CP
2007
Springer
14 years 4 months ago
Limitations of Restricted Branching in Clause Learning
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
Matti Järvisalo, Tommi A. Junttila