Sciweavers

805 search results - page 40 / 161
» Modeling and Analyzing Periodic Distributed Computations
Sort
View
CHI
2010
ACM
14 years 4 months ago
Reactive information foraging for evolving goals
Information foraging models have predicted the navigation paths of people browsing the web and (more recently) of programmers while debugging, but these models do not explicitly m...
Joseph Lawrance, Margaret M. Burnett, Rachel K. E....
COR
2010
164views more  COR 2010»
13 years 9 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
CCGRID
2008
IEEE
14 years 3 months ago
GridBatch: Cloud Computing for Large-Scale Data-Intensive Batch Applications
To be competitive, Enterprises are collecting and analyzing increasingly large amount of data in order to derive business insights. However, there are at least two challenges to m...
Huan Liu, Dan Orban
NPL
1998
133views more  NPL 1998»
13 years 8 months ago
Parallel Coarse Grain Computing of Boltzmann Machines
Abstract. The resolution of combinatorial optimization problems can greatly benefit from the parallel and distributed processing which is characteristic of neural network paradigm...
Julio Ortega, Ignacio Rojas, Antonio F. Día...