Sciweavers

1736 search results - page 302 / 348
» The rank-width of Directed Graphs
Sort
View
AAAI
2010
15 years 2 months ago
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
AAAI
2010
15 years 2 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
78
Voted
LREC
2010
177views Education» more  LREC 2010»
15 years 2 months ago
Maskkot - An Entity-centric Annotation Platform
The Semantic Web is facing the important challenge to maintain its promise of a real world-wide graph of interconnected resources. Unfortunately, while URIs almost guarantee a dir...
Armando Stellato, Heiko Stoermer, Stefano Bortoli,...
ICWS
2008
IEEE
15 years 2 months ago
Generalized Semantics-Based Service Composition
Service-oriented computing (SOC) has emerged as the eminent market environment for sharing and reusing service-centric capabilities. The underpinning for an organization's us...
Srividya Kona, Ajay Bansal, M. Brian Blake, Gopal ...
112
Voted
LREC
2008
159views Education» more  LREC 2008»
15 years 2 months ago
Corpus Exploitation from Wikipedia for Ontology Construction
Ontology construction usually requires a domain-specific corpus for building corresponding concept hierarchy. The domain corpus must have a good coverage of domain knowledge. Wiki...
Gaoying Cui, Qin Lu, Wenjie Li, Yi-Rong Chen