8582 search results - page 119 / 1717 » Here or There |
148
click to vote
MFCS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are c...
151
click to vote
PACT
2007
Springer
16 years 17 days ago
2007
Springer
The application of the Orthogonal Organized Finite State Machine (OOFSM) to the representation of data acquired by sensor networks is proposed. The OOFSM was proposed in earlier wo...
191
click to vote
STACS
2007
Springer
16 years 16 days ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
159
click to vote
IAT
2006
IEEE
16 years 15 days ago
2006
IEEE
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to conges...
156
click to vote
IAT
2006
IEEE
16 years 15 days ago
2006
IEEE
In this paper we present a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...