Sciweavers

2479 search results - page 284 / 496
» Quantum complexity theory
Sort
View
KRMED
2004
15 years 8 months ago
Axioms for parthood and containment relations in bio-ontologies
To fix the semantics of different kinds of parthood relations we require axioms which go beyond those characterizing partial orderings. I formulate such axioms and show their impl...
Thomas Bittner
ECIS
2003
15 years 8 months ago
Politics in packaged software implementation
The academic literature relating to the political issues of information systems is fairly well established. However, there are relatively few empirical studies relating to the pol...
Christopher Bull
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
15 years 8 months ago
On universally easy classes for NP-complete problems
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 8 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
WSC
2004
15 years 8 months ago
Stochastic Petri Nets for Modelling and Simulation
Stochastic Petri nets (SPNs) have proven to be a powerful and enduring graphically-oriented framework for modelling and performance analysis of complex systems. This tutorial focu...
Peter J. Haas