Sciweavers

2373 search results - page 383 / 475
» Complexities for generalized models of self-assembly
Sort
View
COMPGEOM
2008
ACM
15 years 6 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
CSL
2008
Springer
15 years 6 months ago
Quantitative Languages
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
DOLAP
2008
ACM
15 years 6 months ago
Data mining-based fragmentation of XML data warehouses
With the multiplication of XML data sources, many XML data warehouse models have been proposed to handle data heterogeneity and complexity in a way relational data warehouses fail...
Hadj Mahboubi, Jérôme Darmont
ERLANG
2008
ACM
15 years 6 months ago
Early fault detection with model-based testing
Current and future trends for software include increasingly complex requirements on interaction between systems. As a result, the difficulty of system testing increases. Model-bas...
Jonas Boberg
ISPD
2007
ACM
116views Hardware» more  ISPD 2007»
15 years 6 months ago
A morphing approach to address placement stability
Traditionally, research in global placement has focused on relatively few simple metrics, such as pure wirelength or routability estimates. However, in the real world today, desig...
Philip Chong, Christian Szegedy