1989 search results - page 245 / 398 » Set functions for functional logic programming |
125
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
139
click to vote
CIG
2005
IEEE
15 years 9 months ago
2005
IEEE
A newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features a...
153
click to vote
IWPC
2005
IEEE
15 years 9 months ago
2005
IEEE
Comprehension is a key activity that underpins a variety of software maintenance and engineering tasks. The task of understanding object-oriented systems is hampered by the fact t...
148
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
124
click to vote
ASAP
2004
IEEE
15 years 7 months ago
2004
IEEE
Biosequence similarity search is an important application in modern molecular biology. Search algorithms aim to identify sets of sequences whose extensional similarity suggests a c...