Sciweavers

413 search results - page 22 / 83
» On Solving Geometric Optimization Problems Using Shortest Pa...
Sort
View
CCCG
2007
13 years 9 months ago
Optimal Schedules for 2-guard Room Search
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
Stephen Bahun, Anna Lubiw
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Optimal packetization of VLC and convolution coded Markov sequences
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
Xiaohan Wang, Xiaolin Wu
AOR
2010
13 years 5 months ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
13 years 7 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
CGIM
2003
13 years 9 months ago
A Novel Method for 3D Surface Mesh Segmentation
We propose a novel method for the problem of 3D surface mesh segmentation. This mesh segmentation method is based on differential geometry and geodesic distance information. In ou...
Thitiwan Srinark, Chandra Kambhamettu