Sciweavers

8196 search results - page 404 / 1640
» Computational Modeling and Complexity Science
Sort
View
LICS
2009
IEEE
16 years 1 months ago
An Improved Lower Bound for the Complementation of Rabin Automata
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
Yang Cai, Ting Zhang, Haifeng Luo
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
16 years 6 days ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
205
Voted
DAGSTUHL
2010
15 years 8 months ago
Tracking Lines in Higher Order Tensor Fields
While tensors occur in many areas of science and engineering, little has been done to visualize tensors with order higher than two. Tensors of higher orders can be used for exampl...
Mario Hlawitschka, Gerik Scheuermann
DATESO
2006
106views Database» more  DATESO 2006»
15 years 8 months ago
GeKon - Applying Novel Approaches to GIS Development
Abstract. This paper describes a few ideas concerned with geographical information systems (GIS) development. Those ideas come from a GIS development project named GeKon, which is ...
Tomas Richta
IJHCI
2010
117views more  IJHCI 2010»
15 years 5 months ago
Avoiding Latent Design Conditions Using UI Discovery Tools
Motivation – Designers make decisions that later influence how users work with the systems that they have designed. When errors occur in use, it is tempting to focus on the acti...
Harold W. Thimbleby