712 search results - page 82 / 143 » The Complexity of Constructing Evolutionary Trees Using Expe... |
142
click to vote
IANDC
2008
15 years 3 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
123
click to vote
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
ENTCS
2008
15 years 3 months ago
2008
This paper describes experiences from implementing key parts of a compiler for Modelica, an object-oriented language supporting declarative modeling and simulation of complex phys...
128
click to vote
HICSS
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper describes a novel approach using Hidden Markov Models (HMM) to detect complex Internet attacks. These attacks consist of several steps that may occur over an extended pe...
126
click to vote
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...