Sciweavers

1494 search results - page 86 / 299
» Kernels for Global Constraints
Sort
View
ATAL
2003
Springer
14 years 2 months ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
MOBICOM
2005
ACM
14 years 2 months ago
An analytical model for the dimensioning of a GPRS/EDGE network with a capacity constraint on a group of cells
This paper is a contribution to the generic problem of having simple and accurate models to dimension radio cells with data traffic on a GPRS or EDGE network. It addresses the iss...
Georges Nogueira, Bruno Baynat, Pierre Eisenmann
MICRO
1998
IEEE
129views Hardware» more  MICRO 1998»
14 years 1 months ago
A Bandwidth-efficient Architecture for Media Processing
Media applications are characterized by large amounts of available parallelism, little data reuse, and a high computation to memory access ratio. While these characteristics are p...
Scott Rixner, William J. Dally, Ujval J. Kapasi, B...
CPAIOR
2009
Springer
14 years 3 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 10 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong