Sciweavers

1769 search results - page 221 / 354
» Choice in Dynamic Linking
Sort
View
ENDM
2010
105views more  ENDM 2010»
15 years 5 months ago
Minimizing Expected Attacking Cost in Networks
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbe...
CORR
2006
Springer
95views Education» more  CORR 2006»
15 years 5 months ago
Naming Games in Spatially-Embedded Random Networks
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
Qiming Lu, Gyorgy Korniss, Boleslaw K. Szymanski
IJFCS
2006
82views more  IJFCS 2006»
15 years 5 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...
IJON
2006
129views more  IJON 2006»
15 years 5 months ago
Computational and neural mechanisms of task switching
Switching between tasks that overlap in perceptual and response characteristics is assumed to rely upon the maintenance of task representations in prefrontal cortex (PFC). However...
Jeremy R. Reynolds, Todd S. Braver, Joshua W. Brow...
CORR
2007
Springer
107views Education» more  CORR 2007»
15 years 5 months ago
Kinematic Analysis of a New Parallel Machine Tool: the Orthoglide
: This paper describes a new parallel kinematic architecture for machining applications: the orthoglide. This machine features three fixed parallel linear joints which are mounted ...
Philippe Wenger, Damien Chablat