Sciweavers

2485 search results - page 144 / 497
» Time Bounded Frequency Computations
Sort
View
UAI
2004
15 years 6 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
KES
2006
Springer
15 years 5 months ago
A computational framework for package planning
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
Yang Xiang, Michael Janzen
130
Voted
TCS
2008
15 years 5 months ago
The computational complexity of the parallel knock-out problem
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
Hajo Broersma, Matthew Johnson 0002, Daniël P...
146
Voted
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
15 years 4 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
PERVASIVE
2004
Springer
15 years 10 months ago
"Are You with Me?" - Using Accelerometers to Determine If Two Devices Are Carried by the Same Person
As the proliferation of pervasive and ubiquitous computing devices continues, users will carry more devices. Without the ability for these devices to unobtrusively interact with on...
Jonathan Lester, Blake Hannaford, Gaetano Borriell...