Sciweavers

127 search results - page 10 / 26
» Aggregates in Constraint Handling Rules
Sort
View
IJAHUC
2006
128views more  IJAHUC 2006»
14 years 11 months ago
Avoid 'void' in geographic routing for data aggregation in sensor networks
: Wireless sensor networks have attracted great attention in research and industrial development due to its fast-growing application potentials. New techniques must be developed fo...
Shigang Chen, Guangbin Fan, Jun-Hong Cui
ERSHOV
1999
Springer
15 years 3 months ago
On Perfect Supercompilation
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
Jens P. Secher, Morten Heine Sørensen
ICLP
2007
Springer
15 years 5 months ago
Generic Tableaux for Answer Set Programming
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
Martin Gebser, Torsten Schaub
KR
1989
Springer
15 years 3 months ago
Situated Control Rules
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
Mark Drummond
NIPS
2008
15 years 12 days ago
An interior-point stochastic approximation method and an L1-regularized delta rule
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
Peter Carbonetto, Mark Schmidt, Nando de Freitas