Sciweavers

499 search results - page 62 / 100
» A Dynamic-Programming Based ASP-Solver
Sort
View
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 11 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
TASE
2008
IEEE
13 years 11 months ago
An Optimization-Based Approach for Design Project Scheduling
Concurrent engineering has been widely used in managing design projects to speed up the design process by concurrently performing multiple tasks. Since the progress of a design tas...
Ming Ni, Peter B. Luh, Bryan Moser
ICFP
2003
ACM
14 years 11 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano
CCS
2009
ACM
14 years 5 months ago
Privacy-preserving genomic computation through program specialization
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
Rui Wang, XiaoFeng Wang, Zhou Li, Haixu Tang, Mich...
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
14 years 5 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee