Sciweavers

172 search results - page 25 / 35
» Program generation for the all-pairs shortest path problem
Sort
View
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Optimal packetization of VLC and convolution coded Markov sequences
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
Xiaohan Wang, Xiaolin Wu
PDPTA
2007
13 years 9 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker
BMCBI
2005
158views more  BMCBI 2005»
13 years 7 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
HICSS
2000
IEEE
106views Biometrics» more  HICSS 2000»
13 years 12 months ago
Integrating Transportation in a Multi-Site Scheduling Environment
Multi-site scheduling deals with the scheduling problems of an enterprise with several distributed production sites, where sites are using the intermediate products of other sites...
Jürgen Sauer, Hans-Jürgen Appelrath
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 9 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher