3907 search results - page 448 / 782 » Time, Knowledge, and Choice |
191
click to vote
CEEMAS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We are interested in understanding and simulating how humans elaborate plans in situations where knowledge is incomplete and how they interact to obtain missing informati...
161
click to vote
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
175
click to vote
CSR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. How could one estimate the total number of clicks a new advertisement could potentially receive in the current market? This question, called the click volume estimation p...
152
click to vote
FOSSACS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
178
click to vote
ICALP
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...