Sciweavers

3229 search results - page 630 / 646
» The Theory of Timed Automata
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 7 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
JAR
2006
71views more  JAR 2006»
13 years 7 months ago
Mathematical Induction in Otter-Lambda
Otter-lambda is Otter modified by adding code to implement an algorithm for lambda unification. Otter is a resolution-based, clause-language first-order prover that accumulates de...
Michael Beeson
JSAC
2008
140views more  JSAC 2008»
13 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
JOT
2006
73views more  JOT 2006»
13 years 7 months ago
The Initium RJS ScreenSaver: Part 2, UNIX
This paper describes a Java-based screensaver technology for the Initium Remote Job Submission (RJS) system running on UNIX XWindows. Initium RJS is a Java Web Start (JAWS) techno...
Douglas A. Lyon, Francisco Castellanos
MST
2006
136views more  MST 2006»
13 years 7 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl