6833 search results - page 1176 / 1367 » Some two-character sets |
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
179
click to vote
CORR
2008
Springer
2008
Springer
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
15 years 6 months ago
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
171
click to vote
DC
2010
15 years 6 months ago
2010
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
186
click to vote
DEBU
2010
15 years 6 months ago
2010
Databases supporting time dependent and continuously changing geometries, called moving objects databases, have been studied for about 15 years. The field has been flourishing and...
170
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...