Sciweavers

3663 search results - page 145 / 733
» Problems in the ontology of computer programs
Sort
View
WISES
2003
14 years 11 months ago
Logical versus Physical Programming for Ubiquitous Applications
— Ubiquitous computing provides services to users, according to their current situation. Interactions with such programs are as implicit as possible. We find among the applicati...
Julien Pauty, Michel Banâtre, Paul Couderc
AAAI
1998
14 years 11 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
INDIASE
2009
ACM
15 years 4 months ago
An effective learning environment for teaching problem solving in software architecture
A software architect engages in solving Software Engineering (SE) problems throughout his career. Thus inculcating problem solving skills should be one of the learning objectives ...
Kirti Garg, Vasudeva Varma
JSAC
2007
63views more  JSAC 2007»
14 years 10 months ago
A new survivable mapping problem in IP-over-WDM networks
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
Chang Liu, Lu Ruan
ICALP
2005
Springer
15 years 3 months ago
Linear Time Algorithms for Clustering Problems in Any Dimensions
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
Amit Kumar, Yogish Sabharwal, Sandeep Sen