Sciweavers

29908 search results - page 5768 / 5982
» On the Complexity of
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 9 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
JACM
2006
93views more  JACM 2006»
13 years 9 months ago
Combining expert advice in reactive environments
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
Daniela Pucci de Farias, Nimrod Megiddo
JAIR
2006
134views more  JAIR 2006»
13 years 9 months ago
Multi-Issue Negotiation with Deadlines
This paper studies bilateral multi-issue negotiation between self-interested autonomous agents. Now, there are a number of different procedures that can be used for this process; ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
JOC
2008
86views more  JOC 2008»
13 years 9 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
CTW
2007
95views more  CTW 2007»
13 years 9 months ago
Sensemaking, safety, and cooperative work in the intensive care unit
Abstract Making sense of circumstances and situations is critical to coordinate cooperative work. Especially in process control domains, we may expect that effective and reliable o...
Sara Albolino, Richard Cook, Michael O'Connor
« Prev « First page 5768 / 5982 Last » Next »