Sciweavers

268 search results - page 22 / 54
» Mixing time for the solid-on-solid model
Sort
View
79
Voted
CPC
2007
64views more  CPC 2007»
14 years 11 months ago
Sampling Regular Graphs and a Peer-to-Peer Network
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
Colin Cooper, Martin E. Dyer, Catherine S. Greenhi...
COR
2011
14 years 6 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
WSC
2008
15 years 2 months ago
Optimizing staffing schedule in light of patient satisfaction for the whole outpatient hospital ward
The waiting time for patients in outpatient departments of hospitals is a problem throughout the world. In this context, a discrete-event-simulation model was developed to examine...
Soemon Takakuwa, Athula Wijewickrama
WSC
1998
15 years 1 months ago
The Use of Simulation for Construction Elements Manufacturing
The manufacture of pre-cast concrete building elements consists of a few manufacturing steps. The process itself is simple, but the characteristics of the business are quite rando...
Katy Vern, Ali K. Gunal
CAV
2004
Springer
121views Hardware» more  CAV 2004»
15 years 3 months ago
CirCUs: A Satisfiability Solver Geared towards Bounded Model Checking
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
HoonSang Jin, Mohammad Awedh, Fabio Somenzi