Sciweavers

331 search results - page 8 / 67
» Fragments of order
Sort
View
FROCOS
2005
Springer
14 years 1 months ago
A Comprehensive Framework for Combined Decision Procedures
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
MOBIHOC
2008
ACM
14 years 7 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan
DASFAA
2007
IEEE
173views Database» more  DASFAA 2007»
14 years 1 months ago
Towards Adaptive Information Merging Using Selected XML Fragments
As XML information proliferates on the Web, searching XML information via a search engine is crucial to the experience of both casual and experienced Web users. The returned XML fr...
Ho Lam Lau, Wilfred Ng
RECOMB
2010
Springer
13 years 5 months ago
Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
Raluca Uricaru, Alban Mancheron, Eric Rivals