4103 search results - page 407 / 821 » Some results on the Collatz problem |
173
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
189
click to vote
CSSE
2008
IEEE
15 years 8 months ago
2008
IEEE
Both teaching and learning multithreaded ing are complex tasks, due to the abstraction of the concepts, the non-determinism of the scheduler, the impossibility of using classical s...
212
click to vote
NETWORKING
2007
15 years 8 months ago
2007
Abstract. The topology creation is one of the most important step for the design of an overlay network. Traffic characteristic and volume, and behavior of nodes which can be sel...
222
click to vote
PLANX
2007
15 years 8 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
184
click to vote
UAI
2008
15 years 8 months ago
2008
Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they ...