729 search results - page 77 / 146 » Solving subgraph isomorphism problems with constraint progra... |
145
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
128
click to vote
ISQED
2010
IEEE
15 years 5 months ago
2010
IEEE
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
163
click to vote
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 8 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
140
click to vote
BIS
2008
15 years 5 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
139
click to vote
CPAIOR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...