2165 search results - page 106 / 433 » cases 2005 |
136
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
124
Voted
XSYM
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we designed efficient indexing structure for XML documents so that each basic XPath axis step is supported. The indexing structure is built on top of the B+ -tree wh...
139
Voted
ICCBR
2005
Springer
15 years 9 months ago
2005
Springer
Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes r...
159
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
125
Voted
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
— We present SoCExplore, a framework for fast communicationcentric design space exploration of complex SoCs with networkbased interconnects. Speed-up in exploration is achieved t...