Sciweavers

3913 search results - page 393 / 783
» complexity 2006
Sort
View
NETGAMES
2006
ACM
16 years 23 days ago
A practical pricing model of inter-domain multicasting based on game theory
— A practical pricing mechanism is the foundation for the deploying of IP multicast in the inter-domain Internet. The IP multicast service model and its pricing mechanism are dis...
Jinjing Zhao, Peidong Zhu, Xicheng Lu, Feng Zhao
SAC
2006
ACM
16 years 23 days ago
Simplifying transformation of software architecture constraints
The heterogeneity of architectural constraint languages makes difficult the transformation of architectural constraints throughout the development process. Indeed they have signi...
Chouki Tibermacine, Régis Fleurquin, Salah ...
168
Voted
SIGCOMM
2006
ACM
16 years 23 days ago
Revisiting IP multicast
This paper revisits a much explored topic in networking – the search for a simple yet fully-general multicast design. The many years of research into multicast routing have led ...
Sylvia Ratnasamy, Andrey Ermolinskiy, Scott Shenke...
SIGCSE
2006
ACM
128views Education» more  SIGCSE 2006»
16 years 23 days ago
Turning automata theory into a hands-on course
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...
Susan H. Rodger, Bart Bressler, Thomas Finley, Ste...
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
16 years 23 days ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou