9842 search results - page 432 / 1969 » The Complexity of the Matching-Cut Problem |
159
click to vote
ISMVL
1997
IEEE
15 years 9 months ago
1997
IEEE
In this paper, the minimization of incompletely specified multi-valued functions using functional decomposition is discussed. From the aspect of machine learning, learning sample...
129
click to vote
KR
1989
Springer
15 years 8 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
116
click to vote
ARC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper presents a methodology for the design of a reconfigurable computing system applied to a complex problem in molecular Biology: the protein folding problem. An e...
146
click to vote
AAAI
2007
15 years 7 months ago
2007
The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are determinist...
146
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...