1380 search results - page 35 / 276 » A General Polynomial Sieve |
118
click to vote
PCI
2005
Springer
15 years 7 months ago
2005
Springer
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
144
click to vote
PEPM
1995
ACM
15 years 5 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
100
click to vote
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
AAAI
1998
15 years 3 months ago
1998
RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB)and partial order dynamicbacktracking (PDB) have been presented. These algorithms have the property to be additi...
101
click to vote
IJBC
2006
15 years 1 months ago
2006
This paper deals with the problem of finding upper bounds on the number of periodic solutions of a class of one-dimensional non-autonomous differential equations: those with the r...