Sciweavers

1776 search results - page 311 / 356
» Uncertain Linear Constraints
Sort
View
OL
2008
79views more  OL 2008»
13 years 7 months ago
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
Eissa Nematollahi, Tamás Terlaky
SCP
2008
144views more  SCP 2008»
13 years 7 months ago
Implicit ownership types for memory management
Abstract. The Real-time Specification for Java (RTSJ) introduced a range of language features for explicit memory management. While the RTSJ gives programmers fine control over mem...
Tian Zhao, Jason Baker, James Hunt, James Noble, J...
IJRR
2007
181views more  IJRR 2007»
13 years 7 months ago
Optimal Rough Terrain Trajectory Generation for Wheeled Mobile Robots
An algorithm is presented for wheeled mobile robot trajectory generation that achieves a high degree of generality and efficiency. The generality derives from numerical lineariza...
Thomas M. Howard, Alonzo Kelly
AMC
2005
138views more  AMC 2005»
13 years 7 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
TCBB
2008
113views more  TCBB 2008»
13 years 7 months ago
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
Alexander Schliep, Roland Krause