Sciweavers

1716 search results - page 331 / 344
» Proving Conditional Termination
Sort
View
ECAI
2010
Springer
14 years 11 hour ago
On Semantic Update Operators for Answer-Set Programs
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
Martin Slota, João Leite
DEBS
2008
ACM
14 years 5 hour ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
AI
2010
Springer
13 years 11 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
ALMOB
2008
131views more  ALMOB 2008»
13 years 11 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
ALMOB
2007
74views more  ALMOB 2007»
13 years 11 months ago
Evaluating deterministic motif significance measures in protein databases
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...
Pedro Gabriel Ferreira, Paulo J. Azevedo