214 search results - page 30 / 43 » Metrics for evaluation of metaprogram complexity |
IWCMC
2010
ACM
15 years 4 months ago
2010
ACM
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
111
click to vote
ICTAI
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
111
click to vote
EH
2004
IEEE
15 years 3 months ago
2004
IEEE
The use of Application Specific Instruction-set Processors (ASIP) in embedded systems is a solution to the problem of increasing complexity in the functions these systems have to ...
112
click to vote
ALENEX
2003
15 years 1 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
JAIR
2008
14 years 11 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...