Sciweavers

708 search results - page 15 / 142
» Timing closure: the solution and its problems
Sort
View
NOMS
2008
IEEE
175views Communications» more  NOMS 2008»
15 years 4 months ago
Analysis of application performance and its change via representative application signatures
Abstract—Application servers are a core component of a multitier architecture that has become the industry standard for building scalable client-server applications. A client com...
Ningfang Mi, Ludmila Cherkasova, Kivanc M. Ozonat,...
ECCV
2008
Springer
14 years 11 months ago
Reformulating and Optimizing the Mumford-Shah Functional on a Graph - A Faster, Lower Energy Solution
Active contour formulations predominate current minimization of the Mumford-Shah functional (MSF) for image segmentation and filtering. Unfortunately, these formulations necessitat...
Leo Grady, Christopher V. Alvino
ICPADS
2007
IEEE
15 years 4 months ago
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi
CIE
2007
Springer
15 years 4 months ago
Post's Problem for Ordinal Register Machines
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
Joel David Hamkins, Russell G. Miller
CP
2004
Springer
15 years 3 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith