Sciweavers

499 search results - page 55 / 100
» Why neighbor-joining works
Sort
View
CGF
2008
94views more  CGF 2008»
13 years 10 months ago
Statistical optimization of octree searches
This work emerged from the following observation: usual search procedures for octrees start from the root to retrieve the data stored at the leaves. But since the leaves are the fa...
Rener Castro, Thomas Lewiner, Hélio Lopes, ...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 10 months ago
Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs
An important issue towards a broader acceptance of answer-set programming (ASP) is the deployment of tools which support the programmer during the coding phase. In particular, met...
Johannes Oetsch, Jörg Pührer, Hans Tompi...
FMSD
2006
140views more  FMSD 2006»
13 years 10 months ago
Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
Víctor A. Braberman, Alfredo Olivero, Ferna...
PUC
2010
80views more  PUC 2010»
13 years 8 months ago
Mobile map interactions during a rendezvous: exploring the implications of automation
Abstract Location awareness can help facilitate a rendezvous of two or more persons. To further enhance the rendezvous experience, we conducted two complementary field studies to ...
David Dearman, Kori M. Inkpen, Khai N. Truong
SIGSOFT
2010
ACM
13 years 7 months ago
The future of research in free/open source software development
Free/Open Source Software (FOSS) development is not the same an Software Engineering (SE). Why this is so is unclear and open to various interpretations. Both address the challeng...
Walt Scacchi