16257 search results - page 183 / 3252 » D-finiteness: algorithms and applications |
178
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
162
click to vote
4OR
2006
15 years 6 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
151
click to vote
JCC
2008
15 years 6 months ago
2008
Abstract: This article presents a novel concept, the minimal molecular surface (MMS), for the theoretical modeling of biomolecules. The MMS can be viewed as a result of the surface...
188
click to vote
STTT
2008
15 years 6 months ago
2008
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
180
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...