Sciweavers

1686 search results - page 239 / 338
» Programs as polygraphs: computability and complexity
Sort
View
GSN
2009
Springer
137views Sensor Networks» more  GSN 2009»
15 years 8 months ago
A Stimulus-Centric Algebraic Approach to Sensors and Observations
The understanding of complex environmental phenomena, such as deforestation and epidemics, requires observations at multiple scales. This scale dependency is not handled well by to...
Christoph Stasch, Krzysztof Janowicz, Arne Brö...
ATAL
2008
Springer
15 years 6 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss
WICON
2008
15 years 5 months ago
Efficient XML usage within wireless sensor networks
Integrating wireless sensor networks in heterogeneous networks is a complex task. A reason is the absence of a standardized data exchange format that is supported in all participa...
Nils Hoeller, Christoph Reinke, Jana Neumann, Sven...
COR
2008
111views more  COR 2008»
15 years 4 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
SIGCSE
2009
ACM
130views Education» more  SIGCSE 2009»
16 years 4 months ago
Introducing PyLighter: dynamic code highlighter
Like a screenplay, a program is both a static artifact and instructions for a dynamic performance. This duality can keep laypeople from appreciating the complexity of software sys...
Michael G. Boland, Curtis C. Cliburn