Sciweavers

15421 search results - page 344 / 3085
» Dependability
Sort
View
COLING
1996
15 years 8 months ago
Cross-Serial Dependencies Are Not Hard to Process
Carl Vogel, Ulrike Hahn, Holly Branigan
IPCO
1996
89views Optimization» more  IPCO 1996»
15 years 8 months ago
On Dependent Randomized Rounding Algorithms
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
AAAI
1992
15 years 8 months ago
Automated Model Selection Using Context-Dependent Behaviors
Effective problem-solving about complex engineered devices requires device models that are both adequate for the problem and computationally efficient . Producing such models requ...
P. Pandurang Nayak, Leo Joskowicz, Sanjaya Addanki
IJCAI
1989
15 years 8 months ago
Solving Time-Dependent Planning Problems
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...
Mark S. Boddy, Thomas Dean
IJCAI
1989
15 years 8 months ago
Domain Dependence in Parallel Constraint Satisfaction
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
Paul R. Cooper, Michael J. Swain