Sciweavers

2543 search results - page 119 / 509
» Optimal Ordered Problem Solver
Sort
View
NHM
2010
87views more  NHM 2010»
14 years 9 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
MOR
2008
98views more  MOR 2008»
15 years 3 months ago
An Analysis of Monotone Follower Problems for Diffusion Processes
We consider a singular stochastic control problem, which is called the Monotone Follower Stochastic Control Problem and give sufficient conditions for the existence and uniqueness...
Erhan Bayraktar, Masahiko Egami
ESA
2008
Springer
83views Algorithms» more  ESA 2008»
15 years 4 months ago
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...
Samir Khuller, Julián Mestre
CPAIOR
2010
Springer
15 years 1 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...
ICCAD
2006
IEEE
128views Hardware» more  ICCAD 2006»
15 years 12 months ago
Improvements to combinational equivalence checking
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...