Sciweavers

1289 search results - page 165 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
ICIP
2005
IEEE
15 years 3 months ago
Graph cut based segmentation of convoluted objects
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...
Alex Yong Sang Chia, Vitali Zagorodnov
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
15 years 3 months ago
Similarity Queries in Data Bases Using Metric Distances - from Modeling Semantics to Its Maintenance
Similarity queries in traditional databases work directly on attribute values. But, often similar attribute values do not indicate similar meanings. Semantic background information...
Josef Küng, Roland Wagner
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
15 years 3 months ago
Parallel genetic algorithms on line topology of heterogeneous computing resources
This paper evaluates a parallel genetic algorithm (GA) on the line topology of heterogeneous computing resources. Evolution process of parallel GAs is investigated on two types of...
Yiyuan Gong, Morikazu Nakamura, Shiro Tamaki
GECCO
2005
Springer
128views Optimization» more  GECCO 2005»
15 years 3 months ago
Collaborative interactive evolution
Interactive evolutionary computation (IEC) has proven useful in a variety of applications by combining the subjective evaluation of a user with the massive parallel search power o...
Sean R. Szumlanski, Annie S. Wu, Charles E. Hughes
ICOIN
2005
Springer
15 years 3 months ago
RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, Hyunseu...