Sciweavers

INFOCOM
2012
IEEE
12 years 2 months ago
Reverse-engineering BitTorrent: A Markov approximation perspective
Abstract—BitTorrent has been the most popular P2P (Peer-toPeer) paradigm during recent years. Built upon great intuition, the piece-selection and neighbor-selection modules roote...
Ziyu Shao, Hao Zhang, Minghua Chen, Kannan Ramchan...
EVOW
2012
Springer
12 years 8 months ago
HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search
This paper presents HyFlex, a software framework for the development of cross-domain search methodologies. The framework features a common software interface for dealing with diff...
Gabriela Ochoa, Matthew R. Hyde, Timothy Curtois, ...
CEC
2011
IEEE
13 years 12 days ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 11 months ago
Parameterized Complexity Results in Symmetry Breaking
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...
Toby Walsh
TCS
2008
14 years 10 days ago
An annotated bibliography on guaranteed graph searching
Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In t...
Fedor V. Fomin, Dimitrios M. Thilikos
RSA
2006
113views more  RSA 2006»
14 years 10 days ago
Applications of the regularity lemma for uniform hypergraphs
In this note we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on recent results of Nagle, Schacht and the authors, we...
Vojtech Rödl, Jozef Skokan
JMLR
2006
124views more  JMLR 2006»
14 years 12 days ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
CONSTRAINTS
2008
132views more  CONSTRAINTS 2008»
14 years 16 days ago
Essence : A constraint language for specifying combinatorial problems
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
Alan M. Frisch, Warwick Harvey, Christopher Jeffer...
AIR
2010
96views more  AIR 2010»
14 years 17 days ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták
4OR
2007
99views more  4OR 2007»
14 years 17 days ago
Combinatorial optimization problems in wireless switch design
The purpose of this paper is to illustrate the diversity of combinatorial problems encountered in the design of wireless switching systems. This is done via a representative selec...
Renaud Sirdey