8825 search results - page 111 / 1765 » All for one or one for all |
POPL
1994
ACM
15 years 5 months ago
1994
ACM
In this paper we present techniques to nd subsets of nodes of a owgraph that satisfy the followingproperty: A test set that exercises all nodes in a subset exercises allnodes in t...
113
click to vote
CAISE
2006
Springer
15 years 3 months ago
2006
Springer
Given a service request such as scheduling an appointment or purchasing a product, it is possible that the invocation of the service results in too many solutions that all satisfy ...
138
click to vote
SIROCCO
2010
15 years 2 months ago
2010
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
112
click to vote
AAAI
1990
15 years 2 months ago
1990
In previous work [Zlotkin and Rosenschein, 1989a], we have developed a negotiation protocol and offered some negotiation strategies that are in equilibrium. This negotiation proce...
78
Voted
BMCBI
2007
15 years 1 months ago
2007
Background: Research in evolution requires software for visualizing and editing phylogenetic trees, for increasingly very large datasets, such as arise in expression analysis or m...