Sciweavers

251 search results - page 16 / 51
» On the Complexity of Learning Lexicographic Strategies
Sort
View
TCS
2008
13 years 10 months ago
Learning recursive functions: A survey
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...
Thomas Zeugmann, Sandra Zilles
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
14 years 3 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
ATAL
2008
Springer
14 years 12 days ago
Content-oriented composite service negotiation with complex preferences
In e-commerce, for some cases the service requested by the consumer cannot be fulfilled by the producer. In such cases, service consumers and producers need to negotiate their ser...
Reyhan Aydogan
CEC
2005
IEEE
14 years 4 months ago
Effects of experience bias when seeding with prior results
Abstract- Seeding the population of an evolutionary algorithm with solutions from previous runs has proved to be useful when learning control strategies for agents operating in a c...
Mitchell A. Potter, R. Paul Wiegand, H. Joseph Blu...
MIR
2010
ACM
207views Multimedia» more  MIR 2010»
13 years 8 months ago
Learning to rank for content-based image retrieval
In Content-based Image Retrieval (CBIR), accurately ranking the returned images is of paramount importance, since users consider mostly the topmost results. The typical ranking st...
Fabio F. Faria, Adriano Veloso, Humberto Mossri de...