Sciweavers

71228 search results - page 227 / 14246
» Algorithms
Sort
View
ISPD
2000
ACM
92views Hardware» more  ISPD 2000»
15 years 6 months ago
An enhanced perturbing algorithm for floorplan design using the O-tree representation
Recently, a deterministic algorithm based on the O-tree representation has been proposed. This method generates excellent layout results on MCNC test cases with O(n3 ) complexity,...
Yingxin Pang, Chung-Kuan Cheng, Takeshi Yoshimura
CL
2000
Springer
15 years 6 months ago
A Plan Fusion Algorithm for Multi-Agent Systems
We introduce an algorithm for cooperative planning in multi-agent systems. The algorithm enables the agents to combine (fuse) their plans in order to increase their joint profits...
Mathijs de Weerdt, André Bos, Hans Tonino, ...
131
Voted
CADE
1999
Springer
15 years 6 months ago
A PSpace Algorithm for Graded Modal Logic
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
Stephan Tobies
COCOON
1999
Springer
15 years 6 months ago
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
Takeaki Uno
ICPADS
1996
IEEE
15 years 6 months ago
An optimal deadlock resolution algorithm in multidatabase systems
In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of vic...
Xuemin Lin, Jian Chen
« Prev « First page 227 / 14246 Last » Next »