Sciweavers

2536 search results - page 154 / 508
» Constructing Optimal Highways
Sort
View
DAC
2001
ACM
16 years 7 months ago
Improved Cut Sequences for Partitioning Based Placement
Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
Mehmet Can Yildiz, Patrick H. Madden
STOC
2005
ACM
133views Algorithms» more  STOC 2005»
16 years 6 months ago
An O(log n log log n) space algorithm for undirected st-connectivity
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
Vladimir Trifonov
ICEIS
2009
IEEE
16 years 1 months ago
A Service Composition Framework for Decision Making under Uncertainty
Proposed and developed is a service composition framework for decision-making under uncertainty, which is applicable to stochastic optimization of supply chains. Also developed is ...
Malak Al-Nory, Alexander Brodsky, Hadon Nash
ICIP
2007
IEEE
16 years 21 days ago
Graph-Cut Rate Distortion Algorithm for Contourlet-Based Image Compression
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
Maria Trocan, Béatrice Pesquet-Popescu, Jam...
GECCO
2004
Springer
15 years 11 months ago
Finding Maximum Cliques with Distributed Ants
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
Thang Nguyen Bui, Joseph R. Rizzo