Sciweavers

1522 search results - page 67 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
DAC
1996
ACM
13 years 12 months ago
Efficient Approximation Algorithms for Floorplan Area Minimization
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
Danny Z. Chen, Xiaobo Hu
COSIT
1995
Springer
103views GIS» more  COSIT 1995»
13 years 11 months ago
On the Determination of the Optimum Path in Space
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
Emmanuel Stefanakis, Marinos Kavouras
WSCG
2001
108views more  WSCG 2001»
13 years 9 months ago
Co-Operative and Concurrent Blending Motion Generators
In this paper we will be describing a new animation architecture and its implementation in our system LIVE. This model introduces a new blending layer approach which uses several ...
Vincent Bonnafous, Eric Menou, Jean-Pierre Jessel,...
RSCTC
2000
Springer
197views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
Rough Set Approach to CBR
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
Jan Wierzbicki
CSC
2006
13 years 9 months ago
An Adaptive Method for Flow Simulation in Three-Dimensional Heterogeneous Discrete Fracture Networks
Natural fractured media are highly unpredictable because of existing complex structures at the fracture and at the network levels. Fractures are by themselves heterogeneous objects...
Hussein Mustapha