Sciweavers

1995 search results - page 325 / 399
» What's the Problem
Sort
View
123
Voted
ECCC
2006
116views more  ECCC 2006»
15 years 3 months ago
Uniform Hardness Amplification in NP via Monotone Codes
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul...
154
Voted
AAMAS
2004
Springer
15 years 3 months ago
Autonomous Agents that Learn to Better Coordinate
A fundamental difficulty faced by groups of agents that work together is how to efficiently coordinate their efforts. This coordination problem is both ubiquitous and challenging,...
Andrew Garland, Richard Alterman
151
Voted
EC
2000
187views ECommerce» more  EC 2000»
15 years 3 months ago
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function i...
Eckart Zitzler, Kalyanmoy Deb, Lothar Thiele
130
Voted
ETS
2000
IEEE
113views Hardware» more  ETS 2000»
15 years 3 months ago
NetChat: Communication and Collaboration via WWW
Practice has shown that providing content to students alone is not sufficient for good learning results. In computer based training (CBT) and especially webbased training (WBT) en...
Reinhard Kreutz, Sven Kiesow, Klaus Spitzer
154
Voted
EC
1998
112views ECommerce» more  EC 1998»
15 years 3 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley