Sciweavers

3946 search results - page 111 / 790
» The computational complexity of choice sets
Sort
View
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
16 years 24 days ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
MDM
2007
Springer
16 years 19 days ago
Near Optimal Update-Broadcast of Data Sets
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
Sachin Agarwal, Andrew Hagedorn, Ari Trachtenberg
ECAI
2006
Springer
15 years 10 months ago
Coalition Structure Generation in Task-Based Settings
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
Viet Dung Dang, Nicholas R. Jennings
JPDC
2007
191views more  JPDC 2007»
15 years 6 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
BMCBI
2008
99views more  BMCBI 2008»
15 years 6 months ago
Towards a lightweight generic computational grid framework for biological research
Background: An increasing number of scientific research projects require access to large-scale computational resources. This is particularly true in the biological field, whether ...
Mark D. Halling-Brown, David S. Moss, Adrian J. Sh...