Sciweavers

2150 search results - page 380 / 430
» On a restricted cross-intersection problem
Sort
View
TOC
2008
104views more  TOC 2008»
15 years 20 days ago
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
Henning Bruhn, Jakub Cerný, Alexander Hall,...
89
Voted
APAL
2002
101views more  APAL 2002»
15 years 19 days ago
The logic of tasks
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
Giorgi Japaridze
98
Voted
CMOT
2000
105views more  CMOT 2000»
15 years 18 days ago
Generation Supply Bidding in Perfectly Competitive Electricity Markets
This paper reports on the development of a comprehensive framework for the analysis and formulation of bids in competitive electricity markets. Competing entities submit offers of...
George Gross, David Finlay
JCSS
2000
121views more  JCSS 2000»
15 years 16 days ago
The Closure of Monadic NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
Miklós Ajtai, Ronald Fagin, Larry J. Stockm...
93
Voted
MST
2000
57views more  MST 2000»
15 years 16 days ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast