Sciweavers

4926 search results - page 751 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
RTCSA
2005
IEEE
14 years 1 months ago
Scheduling Real-Time Information in a Broadcast System with Non-Real-Time Information
Data broadcast is an efficient information delivery model that can deliver information to a large population simultaneously. In this paper, we propose two efficient algorithms to ...
Hsin-Wen Wei, Pei-Chi Huang, Hsung-Pin Chang, Wei ...
CSCLP
2005
Springer
14 years 1 months ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel
ICRA
2000
IEEE
86views Robotics» more  ICRA 2000»
14 years 18 days ago
Randomized Planning for Short Inspection Paths
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
Tim Danner, Lydia E. Kavraki
DNA
2007
Springer
106views Bioinformatics» more  DNA 2007»
14 years 4 days ago
Hardware Acceleration for Thermodynamic Constrained DNA Code Generation
Reliable DNA computing requires a large pool of oligonucleotides that do not produce cross-hybridize. In this paper, we present a transformed algorithm to calculate the maximum wei...
Qinru Qiu, Prakash Mukre, Morgan Bishop, Daniel J....
GEOINFO
2007
13 years 9 months ago
Polygon Clipping and Polygon Reconstruction
Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against...
Leonardo Guerreiro Azevedo, Ralf Hartmut Güti...