Sciweavers

4305 search results - page 815 / 861
» The Test of Time
Sort
View
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
15 years 4 months ago
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
SIGMOD
2010
ACM
305views Database» more  SIGMOD 2010»
15 years 4 months ago
MoveMine: mining moving object databases
With the maturity of GPS, wireless, and Web technologies, increasing amounts of movement data collected from various moving objects, such as animals, vehicles, mobile devices, and...
Zhenhui Li, Ming Ji, Jae-Gil Lee, Lu An Tang, Yint...
COCOON
2010
Springer
15 years 4 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
ICSE
2010
IEEE-ACM
15 years 4 months ago
Adaptive bug isolation
Statistical debugging uses lightweight instrumentation and statistical models to identify program behaviors that are strongly predictive of failure. However, most software is most...
Piramanayagam Arumuga Nainar, Ben Liblit
EICS
2009
ACM
15 years 4 months ago
Adapting ubicomp software and its evaluation
We describe work in progress on tools and infrastructure to support adaptive component-based software for mobile devices— in our case, Apple iPhones. Our high level aim is ‘de...
Malcolm Hall, Marek Bell, Alistair Morrison, Stuar...