1568 search results - page 254 / 314 » The problem of examination questions in algorithmics |
112
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
137
Voted
MDM
2010
Springer
15 years 8 months ago
2010
Springer
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
153
click to vote
ECAL
1995
Springer
15 years 7 months ago
1995
Springer
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
138
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
121
click to vote
DEXAW
2008
IEEE
15 years 5 months ago
2008
IEEE
In an authorship verification problem one is given writing examples from an author A, and one is asked to determine whether or not each text in fact was written by A. In a more ge...