Sciweavers

699 search results - page 96 / 140
» The method of combinatorial telescoping
Sort
View
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
14 years 23 days ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
FAABS
2000
Springer
14 years 3 days ago
From Livingstone to SMV
To ful ll the needs of its deep space exploration program, NASAis actively supporting research and development in autonomy software. However, the reliable and cost-e ective develop...
Charles Pecheur, Reid G. Simmons
COMPGEOM
2005
ACM
13 years 10 months ago
Dynamic maintenance of molecular surfaces under conformational changes
We present an efficient algorithm for maintaining the boundary and surface area of protein molecules as they undergo conformational changes. We also describe a robust implementati...
Eran Eyal, Dan Halperin
ECCV
2008
Springer
13 years 10 months ago
Reformulating and Optimizing the Mumford-Shah Functional on a Graph - A Faster, Lower Energy Solution
Active contour formulations predominate current minimization of the Mumford-Shah functional (MSF) for image segmentation and filtering. Unfortunately, these formulations necessitat...
Leo Grady, Christopher V. Alvino
EDCC
2008
Springer
13 years 10 months ago
Practical Setup Time Violation Attacks on AES
Faults attacks are a powerful tool to break some implementations of robust cryptographic algorithms such as AES [8] and DES [3]. Various methods of faults attack on cryptographic ...
Nidhal Selmane, Sylvain Guilley, Jean-Luc Danger