Sciweavers

635 search results - page 5 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
ICMAS
2000
14 years 11 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
ISIPTA
2003
IEEE
130views Mathematics» more  ISIPTA 2003»
15 years 2 months ago
Some Results on Generalized Coherence of Conditional Probability Bounds
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo
89
Voted
DAM
2002
82views more  DAM 2002»
14 years 9 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
EDBT
2012
ACM
246views Database» more  EDBT 2012»
12 years 12 months ago
"Cut me some slack": latency-aware live migration for databases
Cloud-based data management platforms often employ multitenant databases, where service providers achieve economies of scale by consolidating multiple tenants on shared servers. I...
Sean Kenneth Barker, Yun Chi, Hyun Jin Moon, Hakan...
HPCA
1998
IEEE
15 years 1 months ago
FPGA Based Custom Computing Machines for Irregular Problems
Over the past few years there has been increased interest in building custom computing machines (CCMs) as a way of achieving very high performance on specific problems. The advent...
David Abramson, Paul Logothetis, Adam Postula, Mar...