5606 search results - page 995 / 1122 » Randomization Techniques for Graphs. |
154
click to vote
ATVA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
154
click to vote
SCIA
2005
Springer
15 years 12 months ago
2005
Springer
Clustering algorithms are intensively used in the image analysis field in compression, segmentation, recognition and other tasks. In this work we present a new approach in clusteri...
207
click to vote
TBILLC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Applying multi-agent systems in real world scenarios requires several essential research questions to be answered. Agents have to perceive their environment in order to t...
172
click to vote
PEWASUN
2004
ACM
15 years 11 months ago
2004
ACM
Interferences in an ad-hoc network can be defined as a set of constraints that specify which groups of nodes cannot transmit simultaneously, and they have significant implications...
161
click to vote
CC
2004
Springer
15 years 11 months ago
2004
Springer
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...