Sciweavers

811 search results - page 16 / 163
» An efficient algorithm for the configuration problem of domi...
Sort
View
ESOP
2009
Springer
13 years 11 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
ICCSA
2010
Springer
13 years 9 months ago
Efficient Algorithms for the 2-Center Problems
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
Tadao Takaoka
SAC
2006
ACM
13 years 7 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
ALENEX
2009
118views Algorithms» more  ALENEX 2009»
13 years 8 months ago
Solving Maximum Flow Problems on Real World Bipartite Graphs
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, B...
JPDC
2007
191views more  JPDC 2007»
13 years 7 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia