Sciweavers

5624 search results - page 216 / 1125
» On Conditional Covering Problem
Sort
View
ICNC
2005
Springer
16 years 2 days ago
DNA Computing for Complex Scheduling Problem
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
ICSE
1993
IEEE-ACM
15 years 10 months ago
"...And Nothing Else Changes": The Frame Problem in Procedure Specifications
We give examples of situations where formal specifications of procedures in the standard pre/postcondition style become lengthy, cumbersome and difficult to change, a problem whic...
Alexander Borgida, John Mylopoulos, Raymond Reiter
IJCAI
2003
15 years 8 months ago
Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilbe...
SCL
2008
56views more  SCL 2008»
15 years 6 months ago
A new vertex result for robustness problems with interval matrix uncertainty
This paper1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a n...
Teodoro Alamo, Roberto Tempo, Daniel R. Ramí...
ANOR
2005
120views more  ANOR 2005»
15 years 6 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello