Sciweavers

432 search results - page 53 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
71
Voted
IPPS
2003
IEEE
15 years 7 months ago
The Reconstruction of a Mobile Agent Computation and Its Validation
We propose a new representation to describe mobile agents computations, where the underlying control structures are diffusing computations. Usually, distributed coms are abstracte...
Mamoun Filali, Philippe Mauran, Gérard Padi...
NETWORKS
2008
15 years 1 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
HPCA
2008
IEEE
16 years 2 months ago
System level analysis of fast, per-core DVFS using on-chip switching regulators
Portable, embedded systems place ever-increasing demands on high-performance, low-power microprocessor design. Dynamic voltage and frequency scaling (DVFS) is a well-known techniq...
Wonyoung Kim, Meeta Sharma Gupta, Gu-Yeon Wei, Dav...
124
Voted
CORR
2008
Springer
167views Education» more  CORR 2008»
15 years 1 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud
IBIS
2006
109views more  IBIS 2006»
15 years 1 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...