2107 search results - page 187 / 422 » Computing Small Search Numbers in Linear Time |
148
click to vote
GRID
2003
Springer
15 years 9 months ago
2003
Springer
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
110
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
141
click to vote
LPNMR
2001
Springer
15 years 8 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
144
click to vote
MOBIHOC
2002
ACM
16 years 3 months ago
2002
ACM
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
142
click to vote
NC
2008
15 years 3 months ago
2008
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...