Sciweavers

4438 search results - page 594 / 888
» The Case for Collaborative Programming
Sort
View
ICALP
2010
Springer
15 years 8 months ago
Choosing, Agreeing, and Eliminating in Communication Complexity
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevit...
ICALP
2010
Springer
15 years 8 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
192
Voted
ICALP
2010
Springer
15 years 8 months ago
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Allan Borodin, Brendan Lucier
ECLIPSE
2005
ACM
15 years 8 months ago
IDE Support for test-driven development and automated grading in both Java and C++
Students need to learn testing skills, and using test-driven development on assignments is one way to help students learn. We use a flexible automated grading system called Web-CA...
Anthony Allowatt, Stephen Edwards
JCKBSE
2008
15 years 8 months ago
Comparing internal and external software quality measurements
Modern software development companies that have a quality assurance program use measurements and standards to improve product quality as perceived by the users of these products. H...
Dimitris Stavrinoudis, Michalis Nik Xenos