Sciweavers

1300 search results - page 186 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
EOR
2010
119views more  EOR 2010»
14 years 10 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao
AAAI
2007
15 years 4 days ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
ICCAD
1998
IEEE
95views Hardware» more  ICCAD 1998»
15 years 2 months ago
Efficient analog circuit synthesis with simultaneous yield and robustness optimization
This paper presents an efficient statistical design methodology that allows simultaneous sizing for performance and optimization for yield and robustness of analog circuits. The s...
Geert Debyser, Georges G. E. Gielen
CDC
2008
IEEE
167views Control Systems» more  CDC 2008»
14 years 11 months ago
Convex formulations of aggregate network air traffic flow optimization problems
The problem of regulating air traffic in the en route airspace of the National Airspace System is studied using an Eulerian network model to describe air traffic flow. The evolutio...
Daniel B. Work, Alexandre M. Bayen
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
15 years 3 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka