Sciweavers

6409 search results - page 343 / 1282
» A Computational Algorithm for Origami Design
Sort
View
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 10 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
DIGRA
2005
Springer
16 years 6 days ago
Realistic Agent Movement in Dynamic Game Environments
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core...
Ross Graham, Hugh McCabe, Stephen Sheridan
DAC
2011
ACM
14 years 6 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
DAC
2004
ACM
16 years 7 months ago
The best of both worlds: the efficient asynchronous implementation of synchronous specifications
The desynchronization approach combines a traditional synchronous specification style with a robust asynchronous implementation model. The main contribution of this paper is the d...
Abhijit Davare, Kelvin Lwin, Alex Kondratyev, Albe...
SOFSEM
2007
Springer
16 years 24 days ago
A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks
We provide the implementation results of the distributed mutual exclusion algorithm based on Ricart-Agrawala algorithm for mobile ad hoc networks (MANETs) using the ns2 simulator d...
Orhan Dagdeviren, Kayhan Erciyes