2006 search results - page 47 / 402 » Heuristic Security-Testing Methods |
AAAI
2010
15 years 2 months ago
2010
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
IJCAI
2007
15 years 1 months ago
2007
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...
104
Voted
ICDM
2009
IEEE
15 years 7 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
118
Voted
ECSQARU
2009
Springer
15 years 7 months ago
2009
Springer
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...
129
Voted
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...