Sciweavers

11484 search results - page 549 / 2297
» Modeling in the Large and Modeling in the Small
Sort
View
EAAI
2008
104views more  EAAI 2008»
15 years 7 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret
FGCS
2006
83views more  FGCS 2006»
15 years 7 months ago
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
Anne Benoit, Brigitte Plateau, William J. Stewart
JSAC
2008
82views more  JSAC 2008»
15 years 7 months ago
Integration of communication and control using discrete time Kuramoto models for multivehicle coordination over broadcast networ
Abstract-- This paper considers the integration of communication and control with respect to the task of coordinated heading control for a group of N vehicles. The heading control ...
Daniel J. Klein, Phillip Lee, Kristi A. Morgansen,...
IJON
2007
95views more  IJON 2007»
15 years 7 months ago
A biophysical neural accumulator model of decision making in an antisaccade task
A biophysical cortico-colicular model of saccade initiation based on competitive integration of planned and reactive cortical saccade decision signals in the intermediate layer of...
Vassilis Cutsuridis, Ioannis Kahramanoglou, Nikola...
IM
2007
15 years 7 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang