Sciweavers

1529 search results - page 176 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
JSCIC
2008
62views more  JSCIC 2008»
15 years 4 months ago
Robustness of a Spline Element Method with Constraints
The spline element method with constraints is a discretization method where the unknowns are expanded as polynomials on each element and Lagrange multipliers are used to enforce th...
Gerard Awanou
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 9 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
15 years 11 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 4 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
ICANN
2001
Springer
15 years 8 months ago
A Computational Intelligence Approach to Optimization with Unknown Objective Functions
In many practical engineering design problems, the form of objective function is not given explicitly in terms of design variables. Given the value of design variables, under this ...
Hirotaka Nakayama, Masao Arakawa, Rie Sasaki