Sciweavers

2588 search results - page 92 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
ECCC
2011
202views ECommerce» more  ECCC 2011»
14 years 8 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
AICOM
2002
103views more  AICOM 2002»
15 years 1 months ago
The emergent computational potential of evolving artificial living systems
The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of socalled c...
Jirí Wiedermann, Jan van Leeuwen
MOC
1998
93views more  MOC 1998»
15 years 1 months ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
STACS
2012
Springer
13 years 9 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
127
Voted
SAC
2005
ACM
15 years 7 months ago
A complex biological database querying method
Many biological information systems rely on relational database management systems (RDBMS) to manage high-throughput biological data. While keeping these data well archived, organ...
Jake Yue Chen, John V. Carlis, Ning Gao