660 search results - page 26 / 132 » Hybrid CSP Solving |
127
click to vote
PLDI
2012
ACM
13 years 6 months ago
2012
ACM
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
131
Voted
CEC
2009
IEEE
15 years 7 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
192
Voted
CPAIOR
2010
Springer
15 years 1 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
138
Voted
HYBRID
2007
Springer
15 years 9 months ago
2007
Springer
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discretetime, controlled stochastic hybrid systems. It i...
130
Voted
APNOMS
2006
Springer
15 years 7 months ago
2006
Springer
This paper shows that geographic information system can successfully solve TSP (travelling salesman problem). It has been done using a module of the designed and implemented by aut...