Sciweavers

8719 search results - page 1731 / 1744
» Visualization of Distributed Processes Using
Sort
View
USENIX
1996
13 years 11 months ago
Transparent Fault Tolerance for Parallel Applications on Networks of Workstations
This paper describes a new method for providingtransparent fault tolerance for parallel applications on a network of workstations. We have designed our method in the context of sh...
Daniel J. Scales, Monica S. Lam
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
13 years 10 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
HUC
2010
Springer
13 years 10 months ago
Groupthink: usability of secure group association for wireless devices
A fairly common modern setting entails users, each in possession of a personal wireless device, wanting to communicate securely, via their devices. If these users (and their devic...
Rishab Nithyanand, Nitesh Saxena, Gene Tsudik, Ers...
GECCO
2008
Springer
196views Optimization» more  GECCO 2008»
13 years 10 months ago
ADANN: automatic design of artificial neural networks
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
Juan Peralta, Germán Gutiérrez, Arac...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
« Prev « First page 1731 / 1744 Last » Next »