Sciweavers

2517 search results - page 162 / 504
» Specifying Weak Sets
Sort
View
ALGORITHMICA
2010
72views more  ALGORITHMICA 2010»
15 years 6 months ago
Largest and Smallest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
Maarten Löffler, Marc J. van Kreveld
CORR
2010
Springer
65views Education» more  CORR 2010»
15 years 6 months ago
Efficient Computation of Optimal Trading Strategies
Given the return series for a set of instruments, a trading strategy is a switching function that transfers wealth from one instrument to another at specified times. We present ef...
Victor Boyarshinov, Malik Magdon-Ismail
DM
2008
102views more  DM 2008»
15 years 6 months ago
Largest subsemigroups of the full transformation monoid
In this paper we are concerned with the following question: for a semigroup S, what is the largest size of a subsemigroup T S where T has a given property? The semigroups S that w...
R. Gray, J. D. Mitchell
IPL
2007
97views more  IPL 2007»
15 years 6 months ago
What is a free name in a process algebra?
There are two popular approaches to specifying the semantics of process algebras: labelled transition semantics and reaction semantics. While the notion of free name is rather unp...
Flemming Nielson, Hanne Riis Nielson, Henrik Pileg...
CORR
2004
Springer
113views Education» more  CORR 2004»
15 years 6 months ago
An approach to membrane computing under inexactitude
In this paper we introduce a fuzzy version of symport/antiport membrane systems. Our fuzzy membrane systems handle possibly inexact copies of reactives and their rules are endowed...
Jaume Casasnovas, Joe Miró, Manuel Moya, Fr...