1197 search results - page 19 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
159
click to vote
ESOP
2009
Springer
15 years 9 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
161
Voted
TCSV
2010
15 years 10 days ago
2010
Abstract--Peer-to-peer (P2P) video-on-demand (VoD) is a popular Internet service for a large number of concurrent users. Streaming capacity in a P2P VoD system is defined as the ma...
163
click to vote
ANTS
2010
Springer
15 years 9 months ago
2010
Springer
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
137
click to vote
GLOBECOM
2008
IEEE
16 years 2 days ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
164
Voted
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...