Sciweavers

811 search results - page 45 / 163
» When Novelty Is Not Enough
Sort
View
CCGRID
2010
IEEE
13 years 9 months ago
Dynamic Auction Mechanism for Cloud Resource Allocation
We propose a dynamic auction mechanism to solve the allocation problem of computation capacity in the environment of cloud computing. Truth-telling property holds when we apply a s...
Wei-Yu Lin, Guan-Yu Lin, Hung-Yu Wei
ARSCOM
2007
77views more  ARSCOM 2007»
13 years 8 months ago
Extremal bipartite graphs with high girth
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
Camino Balbuena, Pedro García-Vázque...
AI
2006
Springer
13 years 8 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
ENTCS
2008
95views more  ENTCS 2008»
13 years 8 months ago
A Rule-based Method to Match Software Patterns Against UML Models
In a UML model, different aspects of a system are covered by different types of diagrams and this bears the risk that an overall system specification becomes barely tractable by t...
Demis Ballis, Andrea Baruzzo, Marco Comini
CORR
2006
Springer
106views Education» more  CORR 2006»
13 years 8 months ago
Reasoning with Intervals on Granules
: The formalizations of periods of time inside a linear model of Time are usually based on the notion of intervals, that may contain or may not their endpoints. This is not enough ...
Sylviane R. Schwer