Sciweavers

252 search results - page 32 / 51
» Why Do Upgrades Fail and What Can We Do about It
Sort
View
CADE
2005
Springer
14 years 8 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison
MOBICOM
2006
ACM
14 years 1 months ago
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
Hannes Frey, Ivan Stojmenovic
BMCBI
2004
98views more  BMCBI 2004»
13 years 7 months ago
STING Millennium Suite: integrated software for extensive analyses of 3d structures of proteins and their complexes
Background: The integration of many aspects of protein/DNA structure analysis is an important requirement for software products in general area of structural bioinformatics. In fa...
Roberto H. Higa, Roberto C. Togawa, Arnaldo J. Mon...
SIGCSE
2009
ACM
111views Education» more  SIGCSE 2009»
14 years 8 months ago
Using daily student presentations to address attitudes and communication skills in CS1
Many CS1 courses lack a breadth in coverage of computing related topics and do not actively engage in nonprogramming computer science topics. In addition, many introductory (and...
Chris Bennett, Timothy Urness
AO
2007
80views more  AO 2007»
13 years 7 months ago
Problems in the ontology of computer programs
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Amnon H. Eden, Raymond Turner