Sciweavers

982 search results - page 103 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
COR
2006
98views more  COR 2006»
15 years 21 days ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
REX
1991
15 years 4 months ago
The Theory of Timed Automata
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
Rajeev Alur, David L. Dill
121
Voted
AAAI
2008
15 years 3 months ago
Limits and Possibilities of BDDs in State Space Search
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
Stefan Edelkamp, Peter Kissmann
105
Voted
JCNS
2010
90views more  JCNS 2010»
14 years 7 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
IPPS
2003
IEEE
15 years 6 months ago
Mesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses th...
Peter Korosec, Jurij Silc, Borut Robic