4679 search results - page 409 / 936 » Modeling When Connections Are the Problem |
161
click to vote
CCCG
2006
15 years 8 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
145
click to vote
FS
2006
15 years 6 months ago
2006
We consider the Merton problem of optimal portfolio choice when the traded instruments are the set of zero-coupon bonds. Working within an infinite-factor Markovian Heath-Jarrow-Mo...
182
click to vote
IJCNN
2006
IEEE
16 years 25 days ago
2006
IEEE
— The optimization of classification systems is often confronted by the solution over-fit problem. Solution over-fit occurs when the optimized classifier memorizes the traini...
161
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
In the past two decades, the simulated annealing technique has been considered as a powerful approach to handle many NP-hard optimization problems in VLSI designs. Recently, a new...
191
click to vote
ESORICS
1998
Springer
15 years 11 months ago
1998
Springer
When implementing a multilevel security policy for Object-Oriented Databases (OODBs), several aspects have to be investigated. One of these aspect is the design of multilevel OODB...