Sciweavers

921 search results - page 49 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
ATAL
2008
Springer
13 years 9 months ago
A broader picture of the complexity of strategic behavior in multi-winner elections
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
BMCBI
2006
123views more  BMCBI 2006»
13 years 7 months ago
SBEAMS-Microarray: database software supporting genomic expression analyses for systems biology
Background: The biological information in genomic expression data can be understood, and computationally extracted, in the context of systems of interacting molecules. The automat...
Bruz Marzolf, Eric W. Deutsch, Patrick Moss, David...
FLAIRS
2007
13 years 10 months ago
Dynamic DDN Construction for Lightweight Planning Architectures
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
William H. Turkett
SCP
1998
163views more  SCP 1998»
13 years 7 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
CP
2000
Springer
13 years 11 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao