181 search results - page 25 / 37 » Minimal molecular surfaces and their applications |
125
click to vote
IJFCS
2006
15 years 1 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
101
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
140
click to vote
CDES
2006
15 years 3 months ago
2006
Compilation has a long history of translating a programmer's human-readable code into machine instructions designed to make good use of a specific target computer. In this pa...
111
Voted
JGO
2010
14 years 8 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
162
click to vote
SIGGRAPH
1992
ACM
15 years 5 months ago
1992
ACM
This paper discusses a new, symbolic approach to geometric modeling called generative modeling. The approach allows specification, rendering, and analysis of a wide variety of sha...