Sciweavers

15485 search results - page 281 / 3097
» Computing Optimal Subsets
Sort
View
SFP
2003
15 years 8 months ago
FSM-Hume is finite state
Abstract Hume is a domain-specific programming language targeting resourcebounded computations. It is based on generalised concurrent bounded automata, controlled by transitions c...
Greg Michaelson, Kevin Hammond, Jocelyn Sér...
CORR
2010
Springer
156views Education» more  CORR 2010»
15 years 6 months ago
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
Serge Gaspers, Mathieu Liedloff
INFORMATIKTAGE
2010
15 years 5 months ago
Context- and Domain-Aware Semantic Web Services
: This research proposal introduces an approach for Semantic Web Services that includes context information when querying a service. Thereby, a mapping between context information ...
Sascha Roth, Bernhard Humm, Michael Rebstock
DISOPT
2011
176views Education» more  DISOPT 2011»
14 years 10 months ago
Valid inequalities and branch-and-cut for the clique pricing problem
Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation net...
Géraldine Heilporn, Martine Labbé, P...
DCOSS
2005
Springer
16 years 5 days ago
Stably Computable Properties of Network Graphs
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
Dana Angluin, James Aspnes, Melody Chan, Michael J...