3228 search results - page 607 / 646 » Computationally Sound Proofs |
115
click to vote
ATAL
2010
Springer
15 years 28 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
106
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
103
click to vote
IANDC
2007
14 years 11 months ago
2007
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
108
Voted
JCP
2007
14 years 11 months ago
2007
—The computational Grid concept is gaining great popularity as the best way to deliver access to a wide range of distributed computing and data resources. But, as Grids move from...
113
click to vote
CG
2005
Springer
14 years 11 months ago
2005
Springer
In this paper, we present a feature-based free-form shape modelling technique based on solving a fundamental problem of reconstructing the depth information from 2D sketch planes....