264 search results - page 10 / 53 » On the possibility of faster SAT algorithms |
CC
1999
Springer
15 years 4 months ago
1999
Springer
Tomita devised a method of generalized LR GLR parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back...
109
click to vote
APN
2008
Springer
15 years 1 months ago
2008
Springer
In this paper we propose two new unfolding semantics for general Petri nets combining the concept of prime event structures with the idea of token flows developed in [11]. In contr...
ACIVS
2010
Springer
14 years 9 months ago
2010
Springer
Detection of objects through scanning windows is widely used and accepted method. The detectors traditionally do not make use of information that is shared between neighboring imag...
106
click to vote
CP
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
144
click to vote
BMCBI
2011
14 years 3 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...