Sciweavers

3663 search results - page 535 / 733
» Problems in the ontology of computer programs
Sort
View
CP
2007
Springer
16 years 1 months ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
CLUSTER
2006
IEEE
16 years 1 months ago
A Performance Prediction Methodology for Data-dependent Parallel Applications
The increase in the use of parallel distributed architectures in order to solve large-scale scientific problems has generated the need for performance prediction for both determi...
Paula Cecilia Fritzsche, Concepció Roig, An...
WIOPT
2006
IEEE
16 years 1 months ago
Connection-level QoS provisioning in multiple transmission technology-based OFDM system
A state-of-the-art orthogonal frequency division multiplexing (OFDM)-based access system, such as the DiffSeg system [1][2], uses a different set of transmission technologies, e.g...
Youngkyu Choi, Sunghyun Choi, Sung-Pil Hong
CHI
2006
ACM
16 years 1 months ago
Tinkering and gender in end-user programmers' debugging
Earlier research on gender effects with software features intended to help problem-solvers in end-user debugging environments has shown that females are less likely to use unfamil...
Laura Beckwith, Cory Kissinger, Margaret M. Burnet...
SAC
2005
ACM
16 years 22 days ago
Selective method combination in mixin-based composition
A mixin is a reusable module that provides uniform extend modifications to classes. It is an abstract subclass that is composable with a variety of superclasses. In mixinbased co...
Tetsuo Kamina, Tetsuo Tamai