Sciweavers

6274 search results - page 581 / 1255
» From query complexity to computational complexity
Sort
View
TCC
2010
Springer
208views Cryptology» more  TCC 2010»
16 years 4 months ago
Rationality in the Full-Information Model
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
Ronen Gradwohl
ISPDC
2007
IEEE
16 years 1 months ago
On Grid-based Matrix Partitioning for Heterogeneous Processors
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
Alexey L. Lastovetsky
CIG
2005
IEEE
16 years 24 days ago
A Generic Approach for Generating Interesting Interactive Pac-Man Opponents
This paper follows on from our previous work focused on formulating an efficient generic measure of user’s satisfaction (‘interest’) when playing predator/prey games. Viewin...
Georgios N. Yannakakis, John Hallam
ECBS
2005
IEEE
160views Hardware» more  ECBS 2005»
16 years 23 days ago
Traceability-Driven Model Refinement for Test Case Generation
Testing complex Computer-Based Systems is not only a demanding but a very critical task. Therefore the use of models for generating test data is an important goal. Tool support du...
Matthias Riebisch, Michael Hübner
LAMAS
2005
Springer
16 years 20 days ago
An Overview of Cooperative and Competitive Multiagent Learning
Abstract Multi-agent systems (MASs) is an area of distributed artificial intelligence that emphasizes the joint behaviors of agents with some degree of autonomy and the complexiti...
Pieter Jan't Hoen, Karl Tuyls, Liviu Panait, Sean ...