Sciweavers

16404 search results - page 704 / 3281
» A set coverage problem
Sort
View
ICTAI
2008
IEEE
16 years 1 months ago
Computational Complexity of Web Service Composition Based on Behavioral Descriptions
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...
Hyunyoung Kil, Wonhong Nam, Dongwon Lee
TACAS
2007
Springer
118views Algorithms» more  TACAS 2007»
16 years 1 months ago
Checking Pedigree Consistency with PCS
Abstract. Many important problems in bioinformatics and genetics require analyses that are NP-complete. For example, one of the basic problems facing researchers that analyze pedig...
Panagiotis Manolios, Marc Galceran Oms, Sergi Oliv...
MFCS
2005
Springer
16 years 23 days ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
COCOON
2006
Springer
15 years 11 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
181
Voted
ECML
2006
Springer
15 years 11 months ago
Improving Control-Knowledge Acquisition for Planning by Active Learning
Automatically acquiring control-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training examples. In the case of planning, examp...
Raquel Fuentetaja, Daniel Borrajo