Sciweavers

7106 search results - page 154 / 1422
» Restricted Complexity, General Complexity
Sort
View
156
Voted
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
135
Voted
ANCS
2005
ACM
15 years 9 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
123
Voted
PODC
2005
ACM
15 years 9 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
139
Voted
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 9 months ago
Constructive induction and genetic algorithms for learning concepts with complex interaction
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
Leila Shila Shafti, Eduardo Pérez
CICLING
2003
Springer
15 years 8 months ago
Starting with Complex Primitives Pays Off
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible...
Aravind K. Joshi