Sciweavers

582 search results - page 61 / 117
» Analysis of Grain's Initialization Algorithm
Sort
View
PERCOM
2008
ACM
14 years 8 months ago
Automatic form filling on mobile devices
Filling out forms of web based services on mobile devices is a very time consuming and frustrating task for users because of the limited text input capabilities. This is a critica...
Enrico Rukzio, Chie Noda, Alexander De Luca, John ...
DAC
1998
ACM
14 years 29 days ago
Adjoint Transient Sensitivity Computation in Piecewise Linear Simulation
This paper presents a general method for computing transient sensitivities using the adjoint method in event driven simulation algorithms that employ piecewise linear device model...
Tuyen V. Nguyen, Anirudh Devgan, Ognen J. Nastov
AIPS
2006
13 years 10 months ago
Scalable Planning for Distributed Stream Processing Systems
Recently the problem of automatic composition of workflows has been receiving increasing interest. Initial investigation has shown that designing a practical and scalable composit...
Anton Riabov, Zhen Liu
COCOON
2010
Springer
13 years 7 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
13 years 7 months ago
On the complexity of optimal reconfiguration planning for modular reconfigurable robots
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
Feili Hou, Wei-Min Shen