Sciweavers

478 search results - page 42 / 96
» A simple expected running time analysis for randomized
Sort
View
CONCUR
2006
Springer
14 years 7 days ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei
CHI
2008
ACM
14 years 9 months ago
Experience sampling for building predictive user models: a comparative study
Experience sampling has been employed for decades to collect assessments of subjects' intentions, needs, and affective states. In recent years, investigators have employed au...
Ashish Kapoor, Eric Horvitz
STACS
2007
Springer
14 years 2 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
WSC
2000
13 years 9 months ago
Improved decision processes through simultaneous simulation and time dilation
Simulation models are often not used to their full potential in the decision-making process. The default simulation strategy of simple serial replication of fixed length runs mean...
Paul Hyden, Lee Schruben
ALDT
2009
Springer
126views Algorithms» more  ALDT 2009»
14 years 15 days ago
On Low-Envy Truthful Allocations
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...