Sciweavers

10289 search results - page 1958 / 2058
» Standard bases in K
Sort
View
ICIW
2009
IEEE
16 years 29 days ago
Towards a Disciplined Engineering of Adaptive Service-Oriented Business Processes
Today’s cross-organizations are increasingly coordinating their capabilities in the quest of dynamically adaptable and thus highly competitive realistic services. Unfortunately,...
Nasreddine Aoumeur, Kamel Barkaoui
AAECC
2009
Springer
136views Algorithms» more  AAECC 2009»
16 years 28 days ago
There Are Not Non-obvious Cyclic Affine-invariant Codes
We show that an affine-invariant code C of length pm is not permutation equivalent to a cyclic code except in the obvious cases: m = 1 or C is either {0}, the repetition code or it...
José Joaquín Bernal, Ángel de...
ACG
2009
Springer
16 years 28 days ago
Plans, Patterns, and Move Categories Guiding a Highly Selective Search
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
Gerhard Trippen
AIRS
2009
Springer
16 years 28 days ago
A Latent Dirichlet Framework for Relevance Modeling
Relevance-based language models operate by estimating the probabilities of observing words in documents relevant (or pseudo relevant) to a topic. However, these models assume that ...
Viet Ha-Thuc, Padmini Srinivasan
WINE
2009
Springer
93views Economy» more  WINE 2009»
16 years 27 days ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
« Prev « First page 1958 / 2058 Last » Next »