Sciweavers

1254 search results - page 19 / 251
» Making Hard Problems Harder
Sort
View
COR
2008
112views more  COR 2008»
15 years 17 days ago
Buffer allocation in general single-server queueing networks
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
Frederico R. B. Cruz, A. R. Duarte, Tom Van Woense...
124
Voted
AMAI
2004
Springer
15 years 5 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
84
Voted
EOR
2008
72views more  EOR 2008»
15 years 16 days ago
The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
The ROADEF challenge is organized every two years by the French Society of Operations Research and Decision-Making Aid. The goal is to allow industrial partners to witness recent ...
Christine Solnon, Van Dat Cung, Alain Nguyen, Chri...
92
Voted
ISSTA
2009
ACM
15 years 7 months ago
Specifying the worst case: orthogonal modeling of hardware errors
During testing, the execution of valid cases is only one part of the task. Checking the behavior in boundary situations and in the presence of errors is an equally important subje...
Jewgenij Botaschanjan, Benjamin Hummel
86
Voted
EGOV
2005
Springer
15 years 6 months ago
Monitoring and Updating Regulations and Policies for Government Services
One of the challenges citizens and businesses face in interacting with governments for entitled services or compliance services is to find the right set of regulations and rules th...
Soon Ae Chun, Edwin Portscher, James Geller