Sciweavers

1757 search results - page 120 / 352
» Alternating Refinement Relations
Sort
View
ANOR
2007
58views more  ANOR 2007»
15 years 3 months ago
A fast swap-based local search procedure for location problems
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
Mauricio G. C. Resende, Renato Fonseca F. Werneck
CCE
2008
15 years 3 months ago
Informative gene selection and design of regulatory networks using integer optimization
A central problem in bioinformatics and systems biology is the selection of appropriate models in a rational and systematic way. This fundamentally combinatorial problem can be re...
Eric Yang, Timothy Maguire, Martin L. Yarmush, Ioa...
DM
2008
112views more  DM 2008»
15 years 3 months ago
On the vertices of the k-additive core
The core of a game v on N, which is the set of additive games dominating v such that (N) = v(N), is a central notion in cooperative game theory, decision making and in combinator...
Michel Grabisch, Pedro Miranda
121
Voted
CORR
2007
Springer
78views Education» more  CORR 2007»
15 years 3 months ago
Hybrid Branching-Time Logics
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
Volker Weber
ACS
2005
15 years 3 months ago
Symmetric Brace Algebras
We develop a symmetric analog of brace algebras and discuss the relation of such algebras to L-algebras. We give an alternate proof that the category of symmetric brace algebras is...
Tom Lada, Martin Markl