Sciweavers

406 search results - page 69 / 82
» Boosting Using Branching Programs
Sort
View
CP
2005
Springer
14 years 2 months ago
Mechanism Design for Preference Aggregation over Coalitions
The aggregation of individuals’ preferences into a single group outcome is both well-studied and fundamental within decision theory. Historically, though, a pervasive simplifica...
Eric I. Hsu, Sheila A. McIlraith
IEE
2010
185views more  IEE 2010»
13 years 7 months ago
Judy - a mutation testing tool for Java
Popular code coverage measures, such as branch coverage, are indicators of the thoroughness rather than the fault detection capability of test suites. Mutation testing is a fault-...
Lech Madeyski, N. Radyk
COMPUTER
2007
93views more  COMPUTER 2007»
13 years 8 months ago
The Computing Profession and Higher Education
not things, but abstractions that represent things. Data use provides human civilization’s foundation, and computers and other digital technologies have merely amplified this us...
W. Neville Holmes
POPL
2011
ACM
12 years 11 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
IISWC
2006
IEEE
14 years 2 months ago
Performance Characterization of SPEC CPU2006 Integer Benchmarks on x86-64 Architecture
— As x86-64 processors become the CPU of choice for the personal computer market, it becomes increasingly important to understand the performance we can expect by migrating appli...
Dong Ye, Joydeep Ray, Christophe Harle, David R. K...