Sciweavers

270 search results - page 22 / 54
» Exploiting Problem Structure for Solution Counting
Sort
View
CP
2003
Springer
14 years 28 days ago
Constraint-Based Optimization with the Minimax Decision Criterion
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...
ICASSP
2010
IEEE
13 years 8 months ago
On distance reconstruction for sensor network localization
Sensor localization typically exploits distance measurements to infer sensor positions with respect to known anchor nodes. Missing or unreliable measurements for specific nodes c...
Phillip A. Regalia, Jing Wang
HYBRID
2007
Springer
14 years 1 months ago
Computational Approaches to Reachability Analysis of Stochastic Hybrid Systems
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discretetime, controlled stochastic hybrid systems. It i...
Alessandro Abate, Saurabh Amin, Maria Prandini, Jo...
PAMI
2011
13 years 2 months ago
Dynamic Programming and Graph Algorithms in Computer Vision
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
Pedro F. Felzenszwalb, Ramin Zabih
ICCD
1999
IEEE
130views Hardware» more  ICCD 1999»
14 years 16 hour ago
Preference-Driven Hierarchical Hardware/Software Partitioning
In this paper, we present a hierarchical evolutionary approach to hardware/software partitioning for real-time embedded systems. In contrast to most of previous approaches, we app...
Gang Quan, Xiaobo Hu, Garrison W. Greenwood