Sciweavers

10997 search results - page 224 / 2200
» On the Structure of Complete Sets
Sort
View
CORR
2010
Springer
182views Education» more  CORR 2010»
15 years 6 months ago
Component structure induced by a random walk on a random graph
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
Colin Cooper, Alan M. Frieze
TRS
2008
15 years 6 months ago
Generalized Indiscernibility Relations: Applications for Missing Values and Analysis of Structural Objects
In this paper, we discuss an approach to structural objects based on a generalisation of indiscernibility relation used in rough set theory. The existing results in rough set theor...
Wojciech Jaworski
MICRO
2009
IEEE
159views Hardware» more  MICRO 2009»
16 years 1 months ago
Adaptive line placement with the set balancing cache
Efficient memory hierarchy design is critical due to the increasing gap between the speed of the processors and the memory. One of the sources of inefficiency in current caches is...
Dyer Rolán, Basilio B. Fraguela, Ramon Doal...
172
Voted
JMLR
2011
142views more  JMLR 2011»
15 years 1 months ago
Causal Search in Structural Vector Autoregressive Models
This paper reviews a class of methods to perform causal inference in the framework of a structural vector autoregressive model. We consider three different settings. In the first ...
Alessio Moneta, Nadine Chlass, Doris Entner, Patri...
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 5 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet