Sciweavers

3663 search results - page 142 / 733
» Problems in the ontology of computer programs
Sort
View
JSS
2007
123views more  JSS 2007»
14 years 10 months ago
Do programmer pairs make different mistakes than solo programmers?
Objective: Comparison of program defects caused by programmer pairs and solo developers. Design: Analysis of programs developed during two counter balanced experiments. Setting: P...
Matthias M. Müller
CAGD
2010
215views more  CAGD 2010»
14 years 10 months ago
Surface fitting and registration of point clouds using approximations of the unsigned distance function
Many problems in computer aided geometric design and geometry processing are stated as least
Simon Flöry, Michael Hofer
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 2 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
15 years 10 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
14 years 10 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler