Sciweavers

5158 search results - page 364 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 10 months ago
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
Riccardo Poli, Leonardo Vanneschi
ACOM
2004
Springer
15 years 10 months ago
A Model of Rational Agency for Communicating Agents
The Cognitive Agent Specification Language (CASL) is a framework for specifying and verifying complex communicating multiagent systems. In this paper, we develop an extended versi...
Shakil M. Khan, Yves Lespérance
ATAL
2006
Springer
15 years 10 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ATAL
2006
Springer
15 years 10 months ago
Computational mechanism design for multi-sensor information fusion
Conventional information fusion architectures are challenged by developments in sensor networks that allow individually-owned (and thereby selfish) sensors to interact and share d...
Alex Rogers, Rajdeep K. Dash, Nicholas R. Jennings...
FOCS
2004
IEEE
15 years 10 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot