94 search results - page 13 / 19 » Proving and Constraint Solving in Computational Origami |
MOC
2000
13 years 7 months ago
2000
A new formulation, a gauge formulation of the incompressible Navier-Stokes equations in terms of an auxiliary field a and a gauge variable , u = a + , was proposed recently by E an...
TAPSOFT
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
ATAL
2003
Springer
14 years 23 days ago
2003
Springer
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
ML
2002
ACM
13 years 7 months ago
2002
ACM
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
ICPP
2007
IEEE
14 years 1 months ago
2007
IEEE
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...