Sciweavers

113 search results - page 16 / 23
» A new Approach for Solving Satisfiability Problems with Qual...
Sort
View
AAAI
2008
13 years 10 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams
WWW
2008
ACM
14 years 8 months ago
Utility-driven load shedding for xml stream processing
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
Mingzhu Wei, Elke A. Rundensteiner, Murali Mani
ASPDAC
2005
ACM
117views Hardware» more  ASPDAC 2005»
14 years 1 months ago
Dynamic symmetry-breaking for improved Boolean optimization
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
HM
2010
Springer
146views Optimization» more  HM 2010»
13 years 7 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 2 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov