Sciweavers

3663 search results - page 493 / 733
» Problems in the ontology of computer programs
Sort
View
MP
2010
94views more  MP 2010»
15 years 5 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
ESWS
2011
Springer
14 years 10 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
CHI
2007
ACM
16 years 7 months ago
Dynamic detection of novice vs. skilled use without a task model
If applications were able to detect a user's expertise, then software could automatically adapt to better match expertise. Detecting expertise is difficult because a user...
Amy Hurst, Scott E. Hudson, Jennifer Mankoff
CHI
2005
ACM
16 years 7 months ago
Design requirements for more flexible structured editors from a study of programmers' text editing
A detailed study of Java programmers' text editing found that the full flexibility of unstructured text was not utilized for the vast majority of programmers' character-...
Andrew Jensen Ko, Htet Htet Aung, Brad A. Myers
CHI
2005
ACM
16 years 7 months ago
Vista: interactive coffee-corner display
In the contemporary information-saturated world, there is a need for an easier, faster, and more social way to keep office workers updated and better aware of surrounding activiti...
Marcin Wichary, Lucy T. Gunawan, Nele Van den Ende...