Sciweavers

3678 search results - page 475 / 736
» On the Stable Paths Problem
Sort
View
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
15 years 7 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
WSC
2004
15 years 7 months ago
Approximating Free Exercise Boundaries for American-Style Options Using Simulation and Optimization
Monte Carlo simulation can be readily applied to asset pricing problems with multiple state variables and possible path dependencies because convergence of Monte Carlo methods is ...
Barry R. Cobb, John M. Charnes
EJC
2000
15 years 7 months ago
KB-VISION: A Tool for Graphical Manipulation and Visualization of Domain Models
Even if a problem solving method and a domain ontology has been identified, there still remains the problem of adding sufficient and consistent domain knowledge to a knowledge proc...
Thorsten Liebig, Dieter Finkenzeller, Marko Luther
170
Voted
CASCON
1996
154views Education» more  CASCON 1996»
15 years 7 months ago
Navigating the textual redundancy web in legacy source
Understanding the source, data, and documentation files associated with legacy systems in preparation for maintenance or reengineering is an increasingly important problem for man...
J. Howard Johnson
CCCG
2009
15 years 6 months ago
Approximating Maximum Flow in Polygonal Domains using Spanners
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou