Sciweavers

831 search results - page 57 / 167
» Coalgebraic Correspondence Theory
Sort
View
CSE
2009
IEEE
15 years 6 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu
INFOCOM
2008
IEEE
15 years 6 months ago
Throughput Anonymity Trade-off in Wireless Networks under Latency Constraints
—Providing anonymity to routes in a wireless ad hoc network from passive eavesdroppers is considered. Using Shannon’s equivocation as an information theoretic measure of anonym...
Parvathinathan Venkitasubramaniam, Lang Tong
LPNMR
2005
Springer
15 years 5 months ago
Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
Lengning Liu, Miroslaw Truszczynski
CAISE
2004
Springer
15 years 5 months ago
Basic Notions Regarding Business Processes and Supporting Information Systems
Six basic notions concerning business processes and their supporting information systems are presented and discussed, on the basis of one common theory. This yields that these noti...
Jan L. G. Dietz
CAV
2004
Springer
120views Hardware» more  CAV 2004»
15 years 5 months ago
Termination of Linear Programs
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
Ashish Tiwari