1813 search results - page 297 / 363 » Instance Pruning Techniques |
ALGORITHMICA
2006
14 years 9 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
EJC
2008
14 years 9 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
CSDA
2006
14 years 9 months ago
2006
For the last decades, research studies have been developed in which a coalition of Fuzzy Sets Theory and Statistics has been established with different purposes. These namely are:...
CSDA
2006
14 years 9 months ago
2006
This article deals with the compact representation of incomplete probabilistic knowledge which can be encountered in risk evaluation problems, for instance in environmental studie...
ENTCS
2006
14 years 9 months ago
2006
We propose a formal method to validate the reliability of a web application, by modeling interactions among its constituent objects. Modeling exploits the recent "Multiple Le...