Sciweavers

8196 search results - page 461 / 1640
» Computational Modeling and Complexity Science
Sort
View
SOFSEM
2010
Springer
16 years 3 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
SIGECOM
2011
ACM
216views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
Strategic sequential voting in multi-issue domains and multiple-election paradoxes
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
Lirong Xia, Vincent Conitzer, Jérôme ...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 11 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
ACMICEC
2008
ACM
243views ECommerce» more  ACMICEC 2008»
15 years 9 months ago
Quality aspects in service ecosystems: areas for exploitation and exploration
Service Science, Management, and Engineering (SSME) is a research area with significant relevance to research and practice. Networked systems of web services are a field of servic...
Christoph Riedl, Tilo Böhmann, Michael Rosema...
MOBIHOC
2009
ACM
15 years 11 months ago
A state-based battery model for nodes' lifetime estimation in wireless sensor networks
We address the problem of estimating the remaining energy of a node battery in wireless sensor networks. To solve this issue, we provide an on-line battery model that requires lim...
Joseph Rahmé, Khaldoun Al Agha