Sciweavers

6506 search results - page 1101 / 1302
» Algorithmic models for sensor networks
Sort
View
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
15 years 8 months ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...
EOR
2008
106views more  EOR 2008»
15 years 3 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
ITNG
2008
IEEE
15 years 9 months ago
Deadlock-Free Multi-Path Routing for Torus-Based NoCs
In our previous work, a Multi-Path Routing (MPR) scheme was proposed to maximize the data throughput for torus-based NoCs by utilizing multiple paths for concurrent data transmiss...
Yaoting Jiao, Mei Yang, Yingtao Jiang, Yulu Yang, ...
TOG
2008
127views more  TOG 2008»
15 years 3 months ago
Freeform surfaces from single curved panels
Motivated by applications in architecture and manufacturing, we discuss the problem of covering a freeform surface by single curved panels. This leads to the new concept of semi-d...
Helmut Pottmann, Alexander Schiftner, Pengbo Bo, H...
134
Voted
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
16 years 3 months ago
Finding tribes: identifying close-knit individuals from employment patterns
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
Lisa Friedland, David Jensen
« Prev « First page 1101 / 1302 Last » Next »