11740 search results - page 360 / 2348 » More Problems in Rewriting |
194
click to vote
ACSW
2004
15 years 8 months ago
2004
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
171
click to vote
ALENEX
2004
15 years 8 months ago
2004
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
161
click to vote
IJCAI
2001
15 years 8 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
177
click to vote
ICALT
2010
IEEE
15 years 7 months ago
2010
IEEE
A nationwide sample of university students completed a survey that asked questions about their perceptions of the factors that can cause problems which exist with online or general...
188
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...