13376 search results - page 451 / 2676 » Problem Solving with |
120
click to vote
BIRTHDAY
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such ...
125
Voted
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
144
click to vote
HICSS
2005
IEEE
15 years 10 months ago
2005
IEEE
Because today’s workforce is highly mobile, small wireless devices are being used to support mobile work collaboration. However, do computer platform differences affect such col...
157
Voted
ICRA
1995
IEEE
15 years 8 months ago
1995
IEEE
The optimal motion generation problem is solved subject to various actuator constraints while the motion is constrained to an arbitrary path. The considered objective function is ...
148
click to vote
JGO
2008
15 years 5 months ago
2008
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...