Sciweavers

8496 search results - page 78 / 1700
» Problem Solving and Complex Systems
Sort
View
FLAIRS
2003
13 years 9 months ago
A Graph Based Synthesis Algorithm for Solving CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
Wanlin Pang, Scott D. Goodwin
ICTAI
2008
IEEE
14 years 2 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
ENTCS
2007
119views more  ENTCS 2007»
13 years 7 months ago
PML: Toward a High-Level Formal Language for Biological Systems
Documentation of knowledge about biological pathways is often informal and vague, making it difficult to efficiently synthesize the work of others into a holistic understanding of...
Bor-Yuh Evan Chang, Manu Sridharan
CC
2006
Springer
147views System Software» more  CC 2006»
13 years 8 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
MFCS
2005
Springer
14 years 1 months 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