Sciweavers

9719 search results - page 251 / 1944
» Answer Set Optimization
Sort
View
CIA
1998
Springer
15 years 11 months ago
Strategies for Querying Information Agents
In a simple cooperative MAS model where a collection of "querying agents" can send queries to a collection of "information agents", we formalize the problem of ...
Prasad Chalasani, Somesh Jha, Onn Shehory, Katia P...
GIS
1995
ACM
15 years 10 months ago
A Window Retrieval Algorithm for Spatial Databases Using Quadtrees
An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving the covering blocks in the underlying spatial database. It works ...
Walid G. Aref, Hanan Samet
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
15 years 5 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola
ISIP
2008
IEEE
16 years 1 months ago
An Approach Towards the Integration of Adaptive Business Intelligent and Constraint Programming
Adaptive Business Intelligence is the discipline that combines prediction, optimization and adaptability into a system answering two important questions: What would probably happe...
José Miguel Rubio, Broderick Crawford
CORR
2010
Springer
60views Education» more  CORR 2010»
15 years 5 months ago
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization
— Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, ...
Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin