4037 search results - page 532 / 808 » Routing without ordering |
CP
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
131
click to vote
FASE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper we present a layered architecture for modeling workflows in Mobile Ad-Hoc NETworks (manets) using algebraic higher order nets (aho nets). manets are networ...
170
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
137
click to vote
ICSE
2007
IEEE-ACM
15 years 10 months ago
2007
IEEE-ACM
Recently, tools for the analysis and visualization of code coverage have become widely available. At first glance, their value in assessing and improving the quality of automated ...
154
click to vote
IWMM
2007
Springer
15 years 10 months ago
2007
Springer
In this work, we present accordion arrays, a straightforward and effective memory compression technique targeting Unicode-based character arrays. In many non-numeric Java programs...