Sciweavers

707 search results - page 112 / 142
» Solving path problems on the GPU
Sort
View
ATAL
2007
Springer
15 years 6 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
TC
2008
14 years 11 months ago
Traffic-Balanced Routing Algorithm for Irregular Mesh-Based On-Chip Networks
On-chip networks (OCNs) have been proposed to solve the increasing scale and complexity of the designs in nanoscale multicore VLSI designs. The concept of irregular meshes is an im...
Shu-Yen Lin, Chun-Hsiang Huang, Chih-Hao Chao, Ken...
EC
1998
112views ECommerce» more  EC 1998»
14 years 11 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
KDD
2012
ACM
247views Data Mining» more  KDD 2012»
13 years 2 months ago
Integrating meta-path selection with user-guided object clustering in heterogeneous information networks
Real-world, multiple-typed objects are often interconnected, forming heterogeneous information networks. A major challenge for link-based clustering in such networks is its potent...
Yizhou Sun, Brandon Norick, Jiawei Han, Xifeng Yan...
CORR
2010
Springer
133views Education» more  CORR 2010»
14 years 12 months ago
Performance evaluation of a new route optimization technique for mobile IP
Mobile ip (mip) is an internet protocol that allows mobile nodes to have continuous network connectivity to the internet without changing their ip addresses while moving to other ...
Moheb R. Girgis, Tarek M. Mahmoud, Youssef S. Takr...