Sciweavers

2446 search results - page 325 / 490
» Choiceless Polynomial Time
Sort
View
PODC
2009
ACM
14 years 8 months ago
Concurrent imitation dynamics in congestion games
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our d...
Heiner Ackermann, Petra Berenbrink, Simon Fischer,...
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 8 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
RECOMB
2004
Springer
14 years 8 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
ICCD
2001
IEEE
121views Hardware» more  ICCD 2001»
14 years 4 months ago
Determining Schedules for Reducing Power Consumption Using Multiple Supply Voltages
Dynamic power is the main source of power consumption in CMOS circuits. It depends on the square of the supply voltage. It may significantly be reduced by scaling down the supply ...
Noureddine Chabini, El Mostapha Aboulhamid, Yvon S...
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 2 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen