27692 search results - page 96 / 5539 » Where is ... |
CPAIOR
2006
Springer
14 years 18 days ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
ICALP
2010
Springer
14 years 16 days ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
AIMSA
2000
Springer
14 years 15 days ago
2000
Springer
Abstract. Decision trees are considered as an efficient technique to express classification knowledge and to use it. However, their most standard algorithms do not deal with uncert...
IWMM
2000
Springer
14 years 14 days ago
2000
Springer
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy ...
COMPGEOM
1991
ACM
14 years 12 days ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...