10568 search results - page 503 / 2114 » Computer Intelligence and Formalization |
171
click to vote
MOZ
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
145
click to vote
ICTAI
1999
IEEE
15 years 9 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
165
Voted
AMET
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. Auction-based electronic commerce is an increasingly interesting domain for AI researchers. In this paper we present an attempt towards the construction of trading agents...
143
click to vote
ATAL
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. In this paper, we consider the issue of designing agents that successfully balance the amount of time spent in reconsidering their intentions against the amount of time s...
150
Voted
CP
1998
Springer
15 years 9 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...