Sciweavers

8540 search results - page 1396 / 1708
» The Dynamic Servers Problem
Sort
View
CAD
2006
Springer
15 years 4 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
EOR
2006
199views more  EOR 2006»
15 years 4 months ago
Short-term booking of air cargo space
This paper proposes a stochastic dynamic programming model for a short-term capacity planning model for air cargo space. The long-term cargo space is usually acquired by freight fo...
Ek Peng Chew, Huei Chuen Huang, Ellis L. Johnson, ...
BMCBI
2007
144views more  BMCBI 2007»
15 years 4 months ago
Accelerated search for biomolecular network models to interpret high-throughput experimental data
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...
Suman Datta, Bahrad A. Sokhansanj
INFFUS
2008
175views more  INFFUS 2008»
15 years 4 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 4 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...
« Prev « First page 1396 / 1708 Last » Next »