28 search results - page 5 / 6 » Developing Efficient Option Pricing Algorithms by Combinator... |
COCOON
2006
Springer
13 years 10 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
ECAI
2000
Springer
13 years 10 months ago
2000
Springer
AutoSteve performs automated electrical design based on qualitative simulation and functional abstraction. It is the first commercial product capable of performing these tasks for ...
VLDB
2002
ACM
13 years 6 months ago
2002
ACM
In spite of the many decades of progress in database research, surprisingly scientists in the life sciences community still struggle with inefficient and awkward tools for queryin...
ALMOB
2006
13 years 6 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
ICCV
2003
IEEE
14 years 8 months ago
2003
IEEE
Surface representation is needed for almost all modeling and visualization applications, but unfortunately, 3D data from a passive vision system are often insufficient for a tradi...