245 search results - page 20 / 49 » Efficient Solving of Time-dependent Answer Set Programs |
183
click to vote
POPL
2008
ACM
16 years 2 days ago
2008
ACM
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
115
click to vote
ICTAI
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Today's molecular biology is confronted with enormous amounts of data, generated by new high-throughput technologies, along with an increasing number of biological m...
SIAMJO
2008
14 years 11 months ago
2008
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
TCBB
2008
14 years 11 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
IANDC
2006
14 years 11 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...