Sciweavers

520 search results - page 19 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Modeling complex luminance variations for target tracking
Lambert's model is widely used in low level computer vision algorithms such as matching, tracking or optical flow computation for example. However, it is well known that thes...
Éric Marchand, Christophe Collewet
NETWORKING
2000
13 years 8 months ago
Spare Capacity Planning for Survivable Mesh Networks
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
Adel Al-Rumaih, David Tipper, Yu Liu, Bryan A. Nor...
ECAI
2010
Springer
13 years 7 months ago
Brothers in Arms? On AI Planning and Cellular Automata
AI Planning is concerned with the selection of actions towards achieving a goal. Research on cellular automata (CA) is concerned with the question how global behaviours arise from ...
Jörg Hoffmann, Nazim Fatès, Héc...
NIPS
2001
13 years 8 months ago
A Parallel Mixture of SVMs for Very Large Scale Problems
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...
Ronan Collobert, Samy Bengio, Yoshua Bengio
DAC
2003
ACM
14 years 8 months ago
A new enhanced constructive decomposition and mapping algorithm
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
Alan Mishchenko, Xinning Wang, Timothy Kam