Sciweavers

666 search results - page 50 / 134
» When Similar Problems Don't Have Similar Solutions
Sort
View
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
14 years 6 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
NIPS
2000
13 years 10 months ago
The Use of MDL to Select among Computational Models of Cognition
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
In Jae Myung, Mark A. Pitt, Shaobo Zhang, Vijay Ba...
GECCO
2000
Springer
131views Optimization» more  GECCO 2000»
14 years 15 days ago
A Genetic Algorithm with Tabu Search for Multimodal and Multiobjective Function Optimization
The integration of genetic algorithms (GAs) and tabu search is one of traditional problems in function optimization in the GA literature. However, most proposed methods have utili...
Setsuya Kurahashi, Takao Terano
OTM
2005
Springer
14 years 2 months ago
QoS-Aware Composition of Web Services: An Evaluation of Selection Algorithms
A composition arranges available services resulting in a defined flow of executions. Before the composition is carried out, a discovery service identifies candidate services. Th...
Michael C. Jaeger, Gero Mühl, Sebastian Golze
SEFM
2007
IEEE
14 years 3 months ago
Supporting Proof in a Reactive Development Environment
Reactive integrated development environments for software engineering have lead to an increase in productivity and quality of programs produced. They have done so by replacing the...
Farhad Mehta