Sciweavers

2357 search results - page 285 / 472
» Computing Refactorings of Behavior Models
Sort
View
135
Voted
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
15 years 7 months ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes
111
Voted
ATAL
2010
Springer
15 years 4 months ago
Ants meeting algorithms
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech
EUROPAR
2010
Springer
15 years 4 months ago
Efficient Address Mapping of Shared Cache for On-Chip Many-Core Architecture
Abstract. Performance of the on-chip cache is critical for processor. The multithread program model usually employed by on-chip many-core architectures may have effects on cache ac...
Fenglong Song, Dongrui Fan, Zhiyong Liu, Junchao Z...
JMLR
2006
80views more  JMLR 2006»
15 years 3 months ago
Using Machine Learning to Guide Architecture Simulation
An essential step in designing a new computer architecture is the careful examination of different design options. It is critical that computer architects have efficient means by ...
Greg Hamerly, Erez Perelman, Jeremy Lau, Brad Cald...
216
Voted
TGC
2010
Springer
15 years 1 months ago
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
Marco Bernardo, Rocco De Nicola, Michele Loreti