Sciweavers

1989 search results - page 384 / 398
» Set functions for functional logic programming
Sort
View
ICALP
2011
Springer
14 years 1 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
PPOPP
2012
ACM
13 years 5 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
ICSE
2012
IEEE-ACM
12 years 12 months ago
Engineering and verifying requirements for programmable self-assembling nanomachines
—We propose an extension of van Lamsweerde’s goal-oriented requirements engineering to the domain of programmable DNA nanotechnology. This is a domain in which individual devic...
Robyn R. Lutz, Jack H. Lutz, James I. Lathrop, Tit...
ISSTA
2009
ACM
15 years 4 months ago
Identifying bug signatures using discriminative graph mining
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
Hong Cheng, David Lo, Yang Zhou, Xiaoyin Wang, Xif...
INFOCOM
2005
IEEE
15 years 3 months ago
Optimal ISP subscription for Internet multihoming: algorithm design and implication analysis
— Multihoming is a popular method used by large enterprises and stub ISPs to connect to the Internet to reduce cost and improve performance. Recently researchers have studied the...
Hao Wang, Haiyong Xie 0002, Lili Qiu, Abraham Silb...