Sciweavers

1522 search results - page 80 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
13 years 7 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
POPL
2009
ACM
14 years 8 months ago
Unifying type checking and property checking for low-level code
We present a unified approach to type checking and property checking for low-level code. Type checking for low-level code is challenging because type safety often depends on compl...
Jeremy Condit, Brian Hackett, Shuvendu K. Lahiri, ...
COSIT
2009
Springer
159views GIS» more  COSIT 2009»
14 years 2 months ago
Adaptable Path Planning in Regionalized Environments
Human path planning relies on several more aspects than only geometric distance between two locations. These additional aspects mostly relate to the complexity of the traveled path...
Kai-Florian Richter
APSEC
2004
IEEE
13 years 11 months ago
Quality Improvements by Integrating Development Processes
Software is an increasing and important part of many products and systems. Software, hardware, and system level components have been developed and produced following separate proc...
Annita Persson Dahlqvist, Ivica Crnkovic, Ulf Askl...
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
14 years 2 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...