Sciweavers

6300 search results - page 50 / 1260
» We have it easy, but do we have it right
Sort
View
99
Voted
MST
2010
83views more  MST 2010»
14 years 11 months ago
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence ...
Harry Buhrman, Lance Fortnow, Michal Koucký...
AICOM
2002
96views more  AICOM 2002»
15 years 21 days ago
Comparing environments for developing software agents
In the last years, dozens of environments for modeling, testing and finally implementing multi-agent systems have been developed. Unfortunately, no standard criteria for understand...
Thomas Eiter, Viviana Mascardi
106
Voted
CSCW
2007
ACM
15 years 24 days ago
Doing Virtually Nothing: Awareness and Accountability in Massively Multiplayer Online Worlds
To date the most popular and sophisticated types of virtual worlds can be found in the area of video gaming, especially in the genre of Massively Multiplayer Online Role Playing Ga...
Robert J. Moore, Nicolas Ducheneaut, Eric Nickell
88
Voted
CEEMAS
2005
Springer
15 years 6 months ago
The "Dance or Work" Problem: Why Do not all Honeybees Dance with Maximum Intensity
A honeybee colony has to choose among several nectar sources in the environment, each fluctuating in quality over time. Successful forager bees return to the hive and perform dance...
Ronald Thenius, Thomas Schmickl, Karl Crailsheim
88
Voted
ALMOB
2007
74views more  ALMOB 2007»
15 years 29 days ago
Evaluating deterministic motif significance measures in protein databases
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...
Pedro Gabriel Ferreira, Paulo J. Azevedo