Sciweavers

2913 search results - page 446 / 583
» How Much to Copy
Sort
View
JAR
2008
81views more  JAR 2008»
13 years 9 months ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah
CORR
2007
Springer
91views Education» more  CORR 2007»
13 years 9 months ago
BrlAPI: Simple, Portable, Concurrent, Application-level Control of Braille Terminals
Screen readers can drive braille devices for allowing visually impaired users to access computer environments, by providing them the same information as sighted users. But in some...
Samuel Thibault, Sébastien Hinderer
JCSS
2008
87views more  JCSS 2008»
13 years 9 months ago
Finding large 3-free sets I: The small n case
There has been much work on the following question: given n, how large can a subset of {1, . . . , n} be that has no arithmetic progressions of length 3. We call such sets 3-free....
William I. Gasarch, James Glenn, Clyde P. Kruskal
INFSOF
2006
90views more  INFSOF 2006»
13 years 9 months ago
Identifying knowledge brokers that yield software engineering knowledge in OSS projects
Much research on open source software development concentrates on developer lists and other software repositories to investigate what motivates professional software developers to...
Sulayman K. Sowe, Ioannis Stamelos, Lefteris Angel...
JEA
2008
112views more  JEA 2008»
13 years 9 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes