Sciweavers

1884 search results - page 209 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
SODA
2003
ACM
106views Algorithms» more  SODA 2003»
15 years 7 months ago
Maintaining all-pairs approximate shortest paths under deletion of edges
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
CNSR
2007
IEEE
104views Communications» more  CNSR 2007»
16 years 20 days ago
Performance Analysis of Web Service Replica Selection in an Extranet
Providing web service replicas improves the overall system performance and redundancy for hardware failures. In Business-to-Business, this may be particularly interesting for orga...
Partheeban Chandrasekaran, Shikharesh Majumdar, Ch...
169
Voted
IUI
2009
ACM
16 years 3 months ago
Using salience to segment desktop activity into projects
Knowledge workers must manage large numbers of simultaneous, ongoing projects that collectively involve huge numbers of resources (documents, emails, web pages, calendar items, et...
Daniel Lowd, Nicholas Kushmerick
IPPS
1998
IEEE
15 years 10 months ago
The Timewheel Group Membership Protocol
Abstract. We describe a group membership protocol, called the timewheel group membership protocol, for a timed asynchronous distributed system. This protocol is a part of the timew...
Shivakant Mishra, Christof Fetzer, Flaviu Cristian
AAAI
2006
15 years 7 months ago
Tractable Classes of Metric Temporal Problems with Domain Rules
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
T. K. Satish Kumar