Sciweavers

1968 search results - page 331 / 394
» The Complexity of Valued Constraint Models
Sort
View
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
15 years 3 months ago
Hot Item Mining and Summarization from Multiple Auction Web Sites
Online auction Web sites are fast changing, highly dynamic, and complex as they involve tremendous sellers and potential buyers, as well as a huge amount of items listed for biddi...
Tak-Lam Wong, Wai Lam
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
ATAL
2003
Springer
15 years 3 months ago
Information-driven phase changes in multi-agent coordination
Large systems of agents deployed in a real-world environment face threats to their problem solving performance that are independent of the complexity of the problem or the charact...
Sven Brueckner, H. Van Dyke Parunak
CBSQ
2003
Springer
15 years 3 months ago
Assessment of High Integrity Software Components for Completeness, Consistency, Fault-Tolerance, and Reliability
The use of formal model based (FMB) methods to evaluate the quality of the components is an important research area. Except for a growing number of exceptions, FMB methods are sti...
Hye Yeon Kim, Kshamta Jerath, Frederick T. Sheldon