6409 search results - page 603 / 1282 » A Computational Algorithm for Origami Design |
175
click to vote
APPROX
2004
Springer
16 years 19 days ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
148
click to vote
GD
2004
Springer
16 years 19 days ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
198
click to vote
RTCSA
2003
IEEE
16 years 15 days ago
2003
IEEE
Previous real-time disk scheduling algorithms assume that each disk request incurs a disk mechanical operation and only consider how to move the disk head under real-time constrain...
196
click to vote
EDBT
2000
ACM
15 years 11 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
201
click to vote
AIPS
2008
15 years 9 months ago
2008
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...