Sciweavers

5417 search results - page 902 / 1084
» Simulation Optimization: Methods and Applications
Sort
View
SPAA
1994
ACM
15 years 2 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
FMCAD
2007
Springer
15 years 2 months ago
Improved Design Debugging Using Maximum Satisfiability
In today's SoC design cycles, debugging is one of the most time consuming manual tasks. CAD solutions strive to reduce the inefficiency of debugging by identifying error sourc...
Sean Safarpour, Hratch Mangassarian, Andreas G. Ve...
APWEB
2006
Springer
15 years 1 months ago
Automatically Constructing Descriptive Site Maps
Rapid increase in the number of pages on web sites, and widespread use of search engine optimization techniques, lead to web sites becoming difficult to navigate. Traditional site ...
Pavel Dmitriev, Carl Lagoze
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 1 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
ICANN
1997
Springer
15 years 1 months ago
Topology Representing Networks for Intrinsic Dimensionality Estimation
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
Jörg Bruske, Gerald Sommer