Sciweavers

1401 search results - page 248 / 281
» Randomness in Interactive Proofs
Sort
View
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 1 months ago
Selecting for evolvable representations
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
Joseph Reisinger, Risto Miikkulainen
EDBT
2009
ACM
131views Database» more  EDBT 2009»
15 years 28 days ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
AAAI
2007
15 years 2 hour ago
The Impact of Network Topology on Pure Nash Equilibria in Graphical Games
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
64
Voted
ATAL
2008
Springer
14 years 11 months ago
Learning task-specific trust decisions
We study the problem of agents locating other agents that are both capable and willing to help complete assigned tasks. An agent incurs a fixed cost for each help request it sends...
Ikpeme Erete, Erin Ferguson, Sandip Sen
69
Voted
DAC
2005
ACM
14 years 11 months ago
Smart diagnostics for configurable processor verification
This paper describes a novel technique called Embedded Test-bench Control (ETC), extensively used in the verification of Tensilica’s latest configurable processor. Conventional ...
Sadik Ezer, Scott Johnson