16504 search results - page 58 / 3301 » New Problems, New Solutions |
134
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that an abstraction for managing the consumption of a global resource i...
123
click to vote
COR
2006
15 years 6 months ago
2006
A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on heurist...
129
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
137
click to vote
ISSAC
2007
Springer
16 years 10 days ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
166
click to vote
CSCLP
2004
Springer
15 years 11 months ago
2004
Springer
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge deco...