Sciweavers

2191 search results - page 261 / 439
» Improving the Efficiency of Non-Deterministic Computations
Sort
View
IJCAI
2003
15 years 7 months ago
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
Carmel Domshlak, Francesca Rossi, Kristen Brent Ve...
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 7 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
150
Voted
IMAGING
2000
15 years 7 months ago
A Composite Spectral Model and Its Applications
A new spectral representation called the composite model is proposed. Its key point is to decompose all spectra into a smooth background and a collection of spikes. The smooth par...
Yinlong Sun, F. David Fracchia, Mark S. Drew
IJCAI
1989
15 years 7 months ago
On Cooperation in a Multi-Entity Model
The problem of modeling a variety of domains within the framework of one general scheme is of central importance in AI. This paper presents the MultiEntity model for multi-agent p...
Moshe Tennenholtz, Yoram Moses
AE
2009
Springer
15 years 7 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez