Sciweavers

9842 search results - page 363 / 1969
» Problem complexity
Sort
View
FLAIRS
2007
15 years 9 months ago
Performance Analysis of Evolutionary Search with a Dynamic Restart Policy
In this work we explore how the complexity of a problem domain affects the performance of evolutionary search using a performance-based restart policy. Previous research indicates...
Michael Solano, Istvan Jonyer
CADE
2007
Springer
16 years 7 months ago
An Incremental Technique for Automata-Based Decision Procedures
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
David Toman, Gulay Ünel
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
16 years 4 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi
DS
1997
104views Database» more  DS 1997»
15 years 8 months ago
Managing Constraint Violations in Administrative Information Systems
This paper motivates a comprehensive methodological framework for dealing with some aspects of real-world complexity in information system analysis and design. By complex applicat...
I. Boydens, Alain Pirotte, Esteban Zimányi
INFOCOM
2010
IEEE
15 years 5 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran