Sciweavers

6315 search results - page 1138 / 1263
» Approximating Solution Structure
Sort
View
ORL
2000
77views more  ORL 2000»
13 years 10 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
ALGORITHMICA
1999
84views more  ALGORITHMICA 1999»
13 years 9 months ago
Computational Approaches to Drug Design
Abstract. The rational approach to pharmaceutical drug design begins with an investigation of the relationship between chemical structure and biological activity. Information gaine...
Paul W. Finn, Lydia E. Kavraki
AMAI
1999
Springer
13 years 9 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
CN
1999
103views more  CN 1999»
13 years 9 months ago
Topology Information Condensation in Hierarchical Networks
Inspired by the PNNI protocol of the ATM Forum, this work focuses on the problem of node aggregation within peer groups and link aggregation between peer groups. It is assumed tha...
Piet Van Mieghem
IJSEKE
1998
141views more  IJSEKE 1998»
13 years 9 months ago
REINAS: A Real-Time System for Managing Environmental Data
Managing scientific data is a challenging task, and many of the problems it presents have yet to be adequately solved. The Real-time Environmental Information Network and Analysi...
Eric C. Rosen, Theodore R. Haining, Darrell D. E. ...
« Prev « First page 1138 / 1263 Last » Next »