Sciweavers

19866 search results - page 245 / 3974
» Computing all factorizations in ***
Sort
View
ICDCN
2011
Springer
14 years 10 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
HUC
2004
Springer
16 years 21 hour ago
Some Assembly Required: Supporting End-User Sensor Installation in Domestic Ubiquitous Computing Environments
This paper explores end-user sensor installation for domestic ubiquitous computing applications and proposes five design principles to support this task. End-user sensor installati...
Chris Beckmann, Sunny Consolvo, Anthony LaMarca
ASSETS
2009
ACM
16 years 1 months ago
Including accessibility within and beyond undergraduate computing courses
This paper presents a unique approach to undergraduate teaching in which accessibility topics are completely integrated throughout the curriculum, treating accessibility not as a ...
Annalu Waller, Vicki L. Hanson, David Sloan
MFCS
2007
Springer
16 years 23 days ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
ITICSE
2004
ACM
16 years 2 days ago
Effective peer assessment for learning computer programming
Peer assessment is a technique that has been successfully employed in a variety of academic disciplines, and which is considered to be effective in developing student’s higher c...
Jirarat Sitthiworachart, Mike Joy