13841 search results - page 2504 / 2769 » Algorithms and Constraint Programming |
159
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
The rapid e-commerce growth has made both business community and customers face a new situation. Due to intense competition on the one hand and the customer's option to choose...
117
click to vote
IJRR
2002
15 years 3 months ago
2002
The contribution of this paper is the expansion of the range of possibilities in the analysis, planning, and control of contact tasks. The successful execution of any contact task...
157
Voted
EC
1998
15 years 3 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
175
Voted
LOGCOM
1998
15 years 3 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
158
Voted
AI
2010
Springer
15 years 24 days ago
2010
Springer
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...