Sciweavers

2477 search results - page 143 / 496
» Approximate extended formulations
Sort
View
ICCS
2005
Springer
15 years 10 months ago
Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
Ion I. Mandoiu, Claudia Prajescu, Dragos Trinca
DLOG
2007
15 years 6 months ago
Modal Logic Applied to Query Answering and the Case for Variable Modalities
We present a query answering technique based on notions and results from modal Correspondence Theory. It allows us to answer a wide family of conjunctive queries by polynomial redu...
Evgeny Zolin
AAAI
1997
15 years 5 months ago
Reinforcement Learning with Time
This paper steps back from the standard infinite horizon formulation of reinforcement learning problems to consider the simpler case of finite horizon problems. Although finite ho...
Daishi Harada
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 4 months ago
Fairness in Combinatorial Auctioning Systems
One of the Multi-Agent Systems that is widely used by various government agencies, buyers and sellers in a market economy, in such a manner so as to attain optimized resource allo...
Megha Saini, Shrisha Rao
FAC
1998
111views more  FAC 1998»
15 years 4 months ago
A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes
In the process-algebraic veri cation of systems with three or more components put in parallel, alphabet axioms are considered to be very useful. These are rules that exploit the i...
Henri Korver, M. P. A. Sellink