1322 search results - page 169 / 265 » Parameterized counting problems |
118
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We consider the offline version of the routing and wavelength assignment (RWA) problem in transparent all-optical networks. In such networks and in the absence of regenerators, ...
137
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
137
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
136
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
160
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...