Sciweavers

1795 search results - page 287 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ICTAI
1993
IEEE
14 years 2 months ago
Short Term Unit-Commitment Using Genetic Algorithms
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This...
Dipankar Dasgupta, Douglas R. McGregor
FSTTCS
1993
Springer
14 years 2 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
MAAMAW
1993
Springer
14 years 2 months ago
Coalition Formation Among Autonomous Agents
Autonomous agents working in multi-agent environments may need to cooperate in order to ful ll tasks. Given a set of agents and a set of tasks which they have to satisfy, we consi...
Steven P. Ketchpel
DOOD
1989
Springer
146views Database» more  DOOD 1989»
14 years 2 months ago
The Object-Oriented Database System Manifesto
This paper attempts to de ne an object-oriented database system. It describes the main features and characteristics that a system must have to qualify as an objectoriented databas...
Malcolm P. Atkinson, François Bancilhon, Da...
ASIACRYPT
2009
Springer
14 years 2 months ago
Proofs of Storage from Homomorphic Identification Protocols
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
Giuseppe Ateniese, Seny Kamara, Jonathan Katz