Sciweavers

1941 search results - page 208 / 389
» On the Hardness of Approximate Reasoning
Sort
View
IJAR
2008
81views more  IJAR 2008»
15 years 6 months ago
Fuzzy region connection calculus: An interpretation based on closeness
One of the key strengths of the region connection calculus (RCC) -- its generality -- is also one of its most important drawbacks for practical applications. The semantics of all ...
Steven Schockaert, Martine De Cock, Chris Cornelis...
IJBRA
2008
66views more  IJBRA 2008»
15 years 6 months ago
Integer programming-based approach to allocation of reporter genes for cell array analysis
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...
Morihiro Hayashida, Fuyan Sun, Sachiyo Aburatani, ...
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 6 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
TCS
2008
15 years 6 months ago
Scheduling to maximize participation
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
JACM
2007
121views more  JACM 2007»
15 years 6 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...