146 search results - page 26 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
IDA
2000
Springer
13 years 10 months ago
2000
Springer
Discovery of multivalueddependenciesfrom database relations isviewed as a search in a hypothesis space de ned according to the generalisation relationship among multivalued depend...
PVLDB
2010
13 years 9 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
AAAI
2006
14 years 10 days ago
2006
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
APN
2008
Springer
14 years 28 days ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
INFORMS
2010
13 years 9 months ago
2010
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...