Sciweavers

14774 search results - page 281 / 2955
» Computational complexity and evolutionary computation
Sort
View
CSDA
2007
109views more  CSDA 2007»
15 years 6 months ago
Improving the computation of censored quantile regressions
Abstract. Censored quantile regressions (CQR) are a valuable tool in economics and engineering. The computation of estimators is highly complex and the performance of standard meth...
Bernd Fitzenberger, Peter Winker
PUC
2002
80views more  PUC 2002»
15 years 6 months ago
Overcoming the Lack of Screen Space on Mobile Computers
One difficulty for interface design on mobile computers is lack of screen space caused by their small size. This paper describes a small pilot study and two formal experiments tha...
Stephen A. Brewster
IJFCS
2010
92views more  IJFCS 2010»
15 years 3 months ago
Collapsing the Hierarchy of Parallel Computational Models
We investigate the computational power of parallel models with directed reconfigurable buses and with shared memory. Based on feasibility considerations present in the literature,...
Stefan D. Bruda, Yuanqiao Zhang
PERCOM
2008
ACM
16 years 6 months ago
A Context Query Language for Pervasive Computing Environments
This paper identifies requirements for querying and accessing context information in mobile and pervasive computing environments. Furthermore it studies existing query languages s...
Roland Reichle, Michael Wagner, Mohammad Ullah Kha...
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
16 years 1 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol