Sciweavers

1662 search results - page 242 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
CAD
2004
Springer
13 years 8 months ago
A single solution method for converting 2D assembly drawings to 3D part drawings
Although solid models play a central role in modern CAD systems, 2D CAD systems are still commonly used for designing products without complex curved faces. Therefore, an importan...
Masaji Tanaka, Laurence Anthony, Toshiaki Kaneeda,...
IPPS
2008
IEEE
14 years 3 months ago
A study of master-slave approaches to parallelize NSGA-II
Many of the optimization problems from the real world are multiobjective in nature, and the reference algorithm for multiobjective optimization is NSGA-II. Frequently, these probl...
Juan José Durillo, Antonio J. Nebro, Franci...
INFOCOM
2005
IEEE
14 years 2 months ago
On static reachability analysis of IP networks
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe how to compute the reachability a network provide...
Geoffrey G. Xie, Jibin Zhan, David A. Maltz, Hui Z...
PC
2007
141views Management» more  PC 2007»
13 years 8 months ago
Physically based simulation of cloth on distributed memory architectures
Physically based simulation of cloth in virtual environments is a computationally demanding problem. It involves modeling the internal material properties of the textile (physical...
Bernhard Thomaszewski, Wolfgang Blochinger
PVLDB
2010
152views more  PVLDB 2010»
13 years 7 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...