Sciweavers

3229 search results - page 350 / 646
» The Theory of Timed Automata
Sort
View
QOSIP
2005
Springer
16 years 9 days ago
Unicast and Multicast QoS Routing with Multiple Constraints
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
Dan Wang, Funda Ergün, Zhan Xu
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
16 years 8 days ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
161
Voted
SENSYS
2004
ACM
16 years 7 days ago
Decentralized synchronization protocols with nearest neighbor communication
A class of synchronization protocols for dense, large-scale sensor networks is presented. The protocols build on the recent work of Hong, Cheow, and Scaglione [5, 6] in which the ...
Dennis Lucarelli, I-Jeng Wang
142
Voted
ILP
2004
Springer
16 years 5 days ago
On Avoiding Redundancy in Inductive Logic Programming
ILP systems induce first-order clausal theories performing a search through very large hypotheses spaces containing redundant hypotheses. The generation of redundant hypotheses ma...
Nuno A. Fonseca, Vítor Santos Costa, Fernan...
BIRTHDAY
2003
Springer
16 years 1 days ago
A Hierarchical Completeness Proof for Propositional Temporal Logic
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
Ben C. Moszkowski