Sciweavers

6833 search results - page 198 / 1367
» Some two-character sets
Sort
View
CSJM
2007
60views more  CSJM 2007»
15 years 4 months ago
An edge colouring of multigraphs
We consider a strict k-colouring of a multigraph G as a surjection f from the vertex set of G into a set of colours {1,2,. . . ,k} such that, for every non-pendant vertex x of G, ...
Mario Gionfriddo, Alberto Amato
JUCS
2006
73views more  JUCS 2006»
15 years 4 months ago
Proving Properties for Behavioural Specifications with Term Observation
: Behavioural specifications allow to focus only on the"observable" behaviour of objects. These observations are made through "observable contexts" which are pa...
Narjes Berregeb
COMCOM
1999
124views more  COMCOM 1999»
15 years 4 months ago
Minimizing the Cost of Fault Location when Testing from a Finite State Machine
If a test does not produce the expected output, the incorrect output may have been caused by an earlier state transfer failure. Ghedamsi and von Bochmann [1992] and Ghedamsi et al...
Robert M. Hierons
ECWEB
2010
Springer
155views ECommerce» more  ECWEB 2010»
15 years 3 months ago
Partial Ranking of Products for Recommendation Systems
A recommendation system (or recommender) is an algorithm whose goal is to recommend products to potential users. To achieve its task, it uses information about some user preference...
Sébastien Hémon, Thomas Largillier, ...
CORR
2011
Springer
181views Education» more  CORR 2011»
14 years 11 months ago
On Isolating Points Using Disks
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan