Sciweavers

498 search results - page 87 / 100
» Constraint Answer Set Programming Systems
Sort
View
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
14 years 1 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth
EC
2008
146views ECommerce» more  EC 2008»
13 years 7 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
QEST
2010
IEEE
13 years 5 months ago
Timed Branching Processes
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
Ashutosh Trivedi, Dominik Wojtczak
GPCE
2009
Springer
14 years 7 days ago
Algorithms for user interfaces
User interfaces for modern applications must support a rich set of interactive features. It is commonplace to find applications with dependencies between values manipulated by us...
Jaakko Järvi, Mat Marcus, Sean Parent, John F...
SCP
2010
155views more  SCP 2010»
13 years 6 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay