Sciweavers

13376 search results - page 234 / 2676
» Problem Solving with
Sort
View
132
Voted
IJFCS
2007
93views more  IJFCS 2007»
15 years 3 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
123
Voted
LPAR
2005
Springer
15 years 9 months ago
A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
Alessandro Dal Palù, Agostino Dovier, Enric...
144
Voted
COMPULOG
1999
Springer
15 years 7 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
STOC
2002
ACM
126views Algorithms» more  STOC 2002»
16 years 3 months ago
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
Sean Hallgren
AAAI
1997
15 years 5 months ago
Models of Continual Computation
Automated problem solving is viewed typically as the expenditure of computation to solve one or more problems passed to a reasoning system. In response to each problem received, e...
Eric Horvitz